A boundary-point LP solution method and its application to dense linear programs. (9th August 2019)

• Record Type: Journal Article
• Authors: Edirisinghe, Chanaka; Ziemba, William
• Is Part Of: International journal of mathematics in operational research. Volume 15:Number 3(2019)
• Page Start: 310
• Page End: 337
• Publication Date: 2019-08-09
• Subjects: linear programming -- nonlinear programming -- steepest descent -- orthogonal projections; Operations research -- Mathematical models -- Periodicals; Operations research -- Mathematics -- Periodicals; Decision making -- Mathematical models -- Periodicals; 658.4033
• Languages: English
• ISSNs: 1757-5850

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.