Complementarity Theorems for Linear Programming
From MaRDI portal
Cited in
(19)- 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
- Optimal simplex tableau characterization of unique and bounded solutions of linear programs
- Theorems on the dimensions of convex sets
- Projection and restriction methods in geometric programming and related problems
- Condition measures and properties of the central trajectory of a linear program
- Limiting behavior of weighted central paths in linear programming
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- On the primal and dual constraint sets in geometric programming
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- On polyhedral extension of some LP theorems
- A Variable-Complexity Norm Maximization Problem
- Polyhedral extensions of some theorems of linear programming
- The complementary unboundedness of dual feasible solution sets in convex programming
- A labeling algorithm for the sensitivity ranges of the assignment problem
This page was built for publication: Complementarity Theorems for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5588261)
