Pages that link to "Item:Q3895225"

The following pages link to Duality gaps in semi-infinite linear programming—an approximation problem (Q3895225):

Displaying 19 items.

• On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
• Strong duality and sensitivity analysis in semi-infinite linear programming (Q507336) (← links)
• Infinite linear programming and online searching with turn cost (Q515543) (← links)
• Limiting Lagrangians: A primal approach (Q761250) (← links)
• Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions (Q1041446) (← links)
• Inequality systems and minimax theorems (Q1059843) (← links)
• Optimal value function in semi-infinite programming (Q1093526) (← links)
• A theory of linear inequality systems (Q1103695) (← links)
• Linear inequalities in mathematical programming and pattern recognition (Q1117138) (← links)
• Geometric fundamentals of the simplex method in semi-infinite programming (Q1117839) (← links)
• Clark's theorem for semi-infinite convex programs (Q1150527) (← links)
• A pathological semi-infinite program verifying Karlovitz's conjecture (Q1158340) (← links)
• Duality in infinite dimensional linear programming (Q1184338) (← links)
• A purification algorithm for semi-infinite programming (Q1197680) (← links)
• On duality in semi-infinite programming and existence theorems for linear inequalities (Q1284031) (← links)
• Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods (Q1646571) (← links)
• On the sufficiency of finite support duals in semi-infinite linear programming (Q1667165) (← links)
• Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
• Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming (Q5245019) (← links)