A boundary-point LP solution method and its application to dense linear programs
by Chanaka Edirisinghe; William Ziemba
International Journal of Mathematics in Operational Research (IJMOR), Vol. 15, No. 3, 2019

Abstract: This paper presents a linear programming solution method that generates a sequence of boundary-points belonging to faces of the feasible polyhedron. The method is based on a steepest descent search by iteratively optimising over a two-dimensional cross section of the polyhedron. It differs from extreme point algorithms such as the simplex method in that optimality is detected by identifying an optimal face of the polyhedron which is not necessarily an extreme point. It also differs from the polynomial-time methods such as the ellipsoid algorithm or projective scaling method that avoids the boundary of the feasible polyhedron. Limited computational analysis with an experimental code of the method, EZLP, indicates that our method performs quite well in total solution time when the number of variables and the density of the constraint matrix increase.

Online publication date: Fri, 06-Sep-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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