TY - CHAP
T1 - The central path
AU - Vanderbei, Robert J.
PY - 2020
Y1 - 2020
N2 - 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. Before we can introduce this method, we must define the path that appears in the name of the method.
AB - 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. Before we can introduce this method, we must define the path that appears in the name of the method.
UR - http://www.scopus.com/inward/record.url?scp=85090020058&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090020058&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-39415-8_17
DO - 10.1007/978-3-030-39415-8_17
M3 - Chapter
AN - SCOPUS:85090020058
T3 - International Series in Operations Research and Management Science
SP - 295
EP - 307
BT - International Series in Operations Research and Management Science
PB - Springer
ER -