Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes

DOI10.1080/02331934.2015.1080254MaRDI QIDQ2810088zbMATH OpenOpenAlexFDO

Authors Qinghong Zhang, K. Kortanek

Publication date 31 May 2016

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

duality results and classification theoryextended Fourier-Motzkin methodsemi-infinite and conic programming

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Projection: A unified approach to semi-infinite linear programs and duality in convex programming
• Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
• On duality in semi-infinite programming and existence theorems for linear inequalities
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• A one-phase algorithm for semi-infinite linear programming

Cites work

• Classifying convex extremum problems over linear topologies having separation properties
• Duality and asymptotic solvability over cones
• Fourier's Method of Linear Programming and Its Dual
• Non-Chebyshevian Moment Problems
• OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
• Projection: A unified approach to semi-infinite linear programs and duality in convex programming
• Some perturbation theory for linear programming
• Understanding linear semi-infinite programming via linear programming over cones

Cited in

(5)

• Recent contributions to linear semi-infinite optimization
• Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
• Recent contributions to linear semi-infinite optimization: an update
• Strong duality and sensitivity analysis in semi-infinite linear programming
• Projection: A unified approach to semi-infinite linear programs and duality in convex programming

This page was built for publication: Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes

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