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

DOI10.1080/02331934.2015.1080254zbMath1384.90111OpenAlexW2196664990MaRDI QIDQ2810088

Qinghong Zhang, Kenneth O. 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

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

Related Items (4)

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

Cites Work

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

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