New redundant constraints for Klee-Minty problem Online publication date: Mon, 25-Oct-2021
by Bib Paruhum Silalahi
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 11, No. 4, 2021
Abstract: Interior-point method (IPM) is a class of methods which has polynomial time for iteration complexity in solving linear optimisation problems. The iteration complexity upper bound of IPM can be stated as O(√N ln N), where N is the number of inequalities. In this paper, we prove that the new redundant constraints of the form: −ρyk-1 − yk ≤ dk may cause the central path visits small neighbourhood of the vertices of the Klee-Minty cube. Our case has smaller number of redundant inequalities compared to best previous results, but of the same order: O(n22n ). In our case the central path goes to at least 2n−1 + 1 of the vertices (half of the vertices + 1).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com