NotesFAQContact Us
Search Tips
Back to results
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ770394
Record Type: Journal
Publication Date: 2002-Jan
Pages: 19
Abstractor: Author
ISSN: ISSN-0020-739X
Interior-Point Methods for Linear Programming: A Review
Singh, J. N.; Singh, D.
International Journal of Mathematical Education in Science and Technology, v33 n3 p405-423 Jan 2002
The paper reviews some recent advances in interior-point methods for linear programming and indicates directions in which future progress can be made. Most of the interior-point methods belong to any of three categories: affine-scaling methods, potential reduction methods and central path methods. These methods are discussed together with infeasible interior methods and homogeneous self-dual methods for linear programming. Also discussed are some theoretical issues in interior-point methods like dependence of complexity bounds on some non-traditional measures different from the input length L of the problem. Finally, the paper concludes with remarks on the comparison of interior-point methods with the simplex method based on their performance on NITLIB suite, a standard collection of test problems.
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site:
Publication Type: Information Analyses; Journal Articles; Reports - Evaluative
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A