Understanding linear semi-infinite programming via linear programming over cones

DOI10.1080/02331930903395865MaRDI QIDQ3066933zbMATH OpenOpenAlexFDO

Authors Qinghong Zhang

Publication date 20 January 2011

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930903395865

zbMATH Keywords

dualityoptimality conditionslinear semi-infinite programminggeometry of the feasible set

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Semi-infinite programming (90C34)

Recommendations

• An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
• Linear semi-infinite programming theory: an updated survey
• scientific article; zbMATH DE number 1985305
• scientific article; zbMATH DE number 4135708
• Optimality theory for semi-infinite linear programming^∗
• scientific article; zbMATH DE number 4114367
• Parametric linear semi-infinite programming
• On Linear Semi-Infinite Programming Problems: An Algorithm
• New constraint qualification and optimality for linear semi-infinite programming
• On the convex programming approach to linear programming

Cites work

• Linear semi-infinite programming theory: an updated survey
• On Haar's dual problem
• Regularizing the abstract convex program
• Semi-Infinite Programming: Theory, Methods, and Applications
• Some applications of optimization in matrix theory
• Strong Duality for Semidefinite Programming

Cited in

(4)

• Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes
• A note on the minimal cone for conic linear programming
• Conic linear programming duals for classes of quadratic semi-infinite programs with applications
• The minimal cone for conic linear programming

This page was built for publication: Understanding linear semi-infinite programming via linear programming over cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066933)