Pages that link to "Item:Q5675150"

The following pages link to Convex analysis treated by linear programming (Q5675150):

Displaying 19 items.

• Limiting Lagrangians: A primal approach (Q761250) (← links)
• In a semi-infinite program only a countable subset of the constraints is essential (Q1079497) (← links)
• An additive eigenvalue problem of physics related to linear programming (Q1099930) (← links)
• Linear inequalities in mathematical programming and pattern recognition (Q1117138) (← links)
• The limiting Lagrangian as a consequence of Helly's theorem (Q1136348) (← links)
• A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\) (Q1136349) (← links)
• A limiting infisup theorem (Q1151826) (← links)
• Perfect duality for convexlike programs (Q1157569) (← links)
• A pathological semi-infinite program verifying Karlovitz's conjecture (Q1158340) (← links)
• Constructing a perfect duality in infinite programming (Q1245773) (← links)
• On duality in semi-infinite programming and existence theorems for linear inequalities (Q1284031) (← links)
• Classifying convex extremum problems over linear topologies having separation properties (Q1844591) (← links)
• Strong duality for standard convex programs (Q2074838) (← links)
• Duality for convex infinite optimization on linear spaces (Q2080839) (← links)
• Perfect duality in solving geometric programming problems under uncertainty (Q2412848) (← links)
• A simplified conjugation scheme for lower semi-continuous functions (Q2810091) (← links)
• A note on perfect duality and limiting lagrangeans (Q3880596) (← links)
• On a classification scheme for geometric programming and complementarity theorems†^† (Q4143032) (← links)
• Convex optimization and lagrange multipliers (Q4187593) (← links)