6. Infeasible-Interior-Point Algorithms
Lists
Only you see this
Abstract
In Chapter 5, we looked at three path-following algorithms that start from a strictly feasible point (x0,λ0,s0) in some neighborhood of the central path. Often, it is not easy to find a starting point that satisfies these conditions. Indeed, there are perfectly valid linear programs for which such points do not even exist. Consider, for instance, the problemmin2x1+x2subject tox1+x2+x3=5,x1+x3=5,x≥0,for which the primal feasible set is {(β,0,5−β)|β∈[0,5]} . Because x2=0 for primal feasible points, the set ℱo of strictly feasible points is empty. More generally, linear programs obtained by transformation of general problems to standard form often have no strictly feasible points, as we see in the exercises.
BibTeX
@inproceedings{wright1997infeasible,
author = {Stephen J. Wright},
title = {{6. Infeasible-Interior-Point Algorithms}},
booktitle = {Society},
year = {1997},
doi = {10.1137/1.9781611971453.ch6},
}Loading related content...