The Central Path

Robert J. Vanderbei
Additional contact information
Robert J. Vanderbei: Princeton University

Chapter Chapter 17 in Linear Programming, 2014, pp 257-268 from Springer

Abstract: Abstract In this chapter, we begin our study of an alternative to the simplex method for solving linear programming problems. The algorithm we are going to introduce is called a path-following method. It belongs to a class of methods called interior-point methods. The path-following method seems to be the simplest and most natural of all the methods in this class, so in this book we focus primarily on it.

Keywords: Barrier Function; Linear Programming Problem; Central Path; Basic Feasible Solution; Minus Infinity (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:isochp:978-1-4614-7630-6_17

Ordering information: This item can be ordered from
http://www.springer.com/9781461476306

DOI: 10.1007/978-1-4614-7630-6_17

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().