Complementarity Theorems for Linear Programming

DOI10.1137/1012015zbMath0193.18606OpenAlexW2026073821MaRDI QIDQ5588261

Alton C. Williams

Publication date: 1970

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1012015

zbMATH Keywords

operations research

Related Items (19)

Sparse solutions to an underdetermined system of linear equations via penalized Huber loss ⋮ Limiting behavior of weighted central paths in linear programming ⋮ New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations ⋮ A Variable-Complexity Norm Maximization Problem ⋮ Boundedness relations in linear semi-infinite programming ⋮ A theory of linear inequality systems ⋮ Stability of linearly constrained convex quadratic programs ⋮ Marginal values in mixed integer linear programming ⋮ Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming ⋮ Optimal simplex tableau characterization of unique and bounded solutions of linear programs ⋮ A labeling algorithm for the sensitivity ranges of the assignment problem ⋮ The complementary unboundedness of dual feasible solution sets in convex programming ⋮ Theorems on the dimensions of convex sets ⋮ Projection and restriction methods in geometric programming and related problems ⋮ On the primal and dual constraint sets in geometric programming ⋮ Condition measures and properties of the central trajectory of a linear program ⋮ Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines ⋮ On polyhedral extension of some LP theorems ⋮ Polyhedral extensions of some theorems of linear programming

This page was built for publication: Complementarity Theorems for Linear Programming