The set of target vectors in a semi-infinite linear program with a duality gap

DOI10.1134/S0081543819020032zbMath1419.90061OpenAlexW2953529364MaRDI QIDQ2317358

Yanyan Li

Publication date: 9 August 2019

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543819020032

zbMATH Keywords

geometric approachduality gapsemi-infinite linear programconvex nonclosed coneset of target vectors

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)

Related Items (2)

Recent contributions to linear semi-infinite optimization: an update ⋮ DualityGapAnalyzer

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• A note on duality gaps in linear programming over convex sets
• Programmes in Paired Spaces
• Duality gaps in semi-infinite linear programming—an approximation problem
• A duality theory for convex programs with convex constraints
• An Infinite Linear Program with a Duality Gap
• Algebraic theory of linear inequalities
• Convex Analysis

This page was built for publication: The set of target vectors in a semi-infinite linear program with a duality gap