Primal-Dual Interior-Point Methods VI: The Simplified Homogeneous Self-Dual Form Decides Whether an LP Has a SolutionTextbook
Interior-point methods for linear programming are usually analysed under the assumption that the primal-dual pair has a strictly feasible point, or at least a solution. A solver used in practice cannot assume this: it must either return a solution or report that the primal or the dual problem is infeasible. The homogeneous self-dual approach embeds the…