Optimization for Decision Making pp 393416  Cite as
Interior Point Methods for LP
Chapter
First Online:
Abstract
In a linear program, typically there are inequality constraints, and equality constraints, on the variables. In LP literature, a feasible solution is known as a:

boundary feasible solution: if it satisfies at least one inequality constraint in the problem as an equation;

interior feasible solution: if it satisfies all inequality constraints in the problem as strict inequalities.
Methods for solving LPs which move along boundary feasible solutions are called boundary point methods; and those that move only among interior feasible solutions are called interior point methods.
References
 Chang SY, Murty KG (1989) The steepest descent gravitational method for linear programming. Discrete Applied Mathematics 25:211–239CrossRefGoogle Scholar
 Dennis JE Jr, Schnabel RB (1983) Numerical Methods for Unconstrained Optimization and Nonlinear Equations. PrenticeHall, Englewood Cliffs, NJGoogle Scholar
 Fletcher R (1981) Practical Methods of Optimization. Vols. 1, 2. WileyInterscience, New YorkGoogle Scholar
 Kojima M, Mizuno S, Yoshise A (1989) A primaldual interior point algorithm for linear programming. Progress in Mathematical Programming: Interior Point and Related Methods. Megiddo N (ed), SpringerVerlag, New York, 2:29–47Google Scholar
 Megiddo N (1989) Pathways to the optimal set in linear programming. Progress in Mathematical Programming: Interior Point and Related Methods. Meggiddo N (ed), SpringerVerlag, New York, 8:131–158Google Scholar
 Mehrotra S (1992) On the implementation of a primaldual interior point method. SIAM Journal on Optimization 2:575–601CrossRefGoogle Scholar
 Mehrotra S, Ye Y (1993) Finding an interior point in the optimal face of linear programs. Mathematical Programming 62:497–515CrossRefGoogle Scholar
 Mizuno S, Todd M, Ye Y (1993) On adaptive step primaldual interior point algorithms for linear programming. Mathematics of Operations Research 18:964–981CrossRefGoogle Scholar
 Monteiro RDC, Adler I (1989) Interior pathfollowing primaldual algorithms, Part I: Linear programming. Mathematical Programming 44:27–41CrossRefGoogle Scholar
 Murty KG (1986) The Gravitational method for LP. Opsearch 23(4):206–214Google Scholar
 Ortega JM, Rheinboldt WC (1970) Iterative Solutions of Nonlinear Equations in Several Variables. Academic Press, NYGoogle Scholar
 Roos C, Terlaky T, Vial JPh (2006) Interior Point Methods for Linear Optimization. Springer, New YorkGoogle Scholar
 Saigal R (1995) Linear Programming A Modern Integrated Analysis. Kluwer Academic Publishers, Boston, MAGoogle Scholar
 Sonnevend G, Stoer J, Zhao G (1989) On the complexity of following the central path of linear programming by linear extrapolation. Mathematics of Operations Research 62:19–31Google Scholar
 Wright SJ (1997) PrimalDual InteriorPoint Methods. SIAM, Philadelphia, PACrossRefGoogle Scholar
 Ye Y (1992) On the finite convergence of interiorpoint algorithms for linear programming. Mathematical Programming 57:325–335CrossRefGoogle Scholar
 Ye Y (1997) Interior Point Algorithms, Theory and Analysis. WileyInterscience, New YorkCrossRefGoogle Scholar
Copyright information
© Springer Science+Business Media, LLC 2010