Pages that link to "Item:Q5588261"

The following pages link to Complementarity Theorems for Linear Programming (Q5588261):

Displaying 19 items.

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