Abstract
A primal, interior point method is developed for linear programming problems for which the linear objective function is to be maximised over polyhedra that are not necessarily in standard form. This algorithm concurs with the affine scaling method of Dikin when the polyhedron is in standard form, and satisfies the usual conditions imposed for using that method. If the search direction is regarded as a function of the current iterate, then it is shown that this function has a unique, continuous extension to the boundary. In fact, on any given face, this extension is just the value the search direction would have for the problem of maximising the objective function over that face. This extension is exploited to prove convergence. The algorithm presented here can be used to exploit such special constraint structure as bounds, ranges, and free variables without increasing the size of the linear programming problem.
Similar content being viewed by others
References
Barnes ER (1986) A variation on Karmarkar's algorithm for solving linear programming problems. Math Programming 36:174–182
Bayer DA, Lagarias JC (1989) The nonlinear geometry of linear programming I: Affine and projective scaling trajectories. Trans Amer Math Soc 314:499–526
Dikin II (1964) Iterative solutions of linear and quadratic programming problems. Dokl Akad Nauk SSSR 174:747–748 (Russian) English transl, Soviet Math Dokl (1967) 8:674–675
Dowling ML (1994) An affine scaling method for non-linear programming. Habilitation thesis at the Technical University of Braunschweig
Fang SC, Puthenpura S (1993) Linear optimization and extensions. Prentice Hall, Englewood Cliffs
Franklin J (1987) Convergence in Karmarkar's algorithm. SIAM J Numer Anal 24:928–945
Golub GH, van Loan CF (1990) Matrix computations, second ed. The Johns Hopkins University Press, Baltimore
Karmarkar NK (1984) A new polynomial time algorithm for linear programming. Combinatorica 4:373–395
Megiddo N, Shub M (1989) Boundary behavior of interior point algorithms in linear programming. Math Oper Res 14:97–146
Vanderbei RJ, Meketon MJ, Freedman BA (1986) A modification of Karmarkar's linear programming algorithm. Algorithmica 1:395–407
Author information
Authors and Affiliations
Additional information
This paper is in final form and no version of it will be submitted for publication elsewhere.
Rights and permissions
About this article
Cite this article
Dowling, M.L. An affine scaling algorithm for linear programming problems with inequality constraints. Mathematical Methods of Operations Research 43, 301–318 (1996). https://doi.org/10.1007/BF01194550
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01194550