A boundary-point LP solution method and its application to dense linear programs

Chanaka Edirisinghe and William Ziemba

International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 3, 310-337

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.

Keywords: linear programming; nonlinear programming; steepest descent; orthogonal projections. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=102076 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:15:y:2019:i:3:p:310-337

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().