Connections between generalized, inexact and semi-infinite linear programming

DOI10.1007/BF01415936zbMath0694.90076MaRDI QIDQ3470252

No author found.

Publication date: 1989

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

linear semi-infinite programminggeneralized linear programminginexact linear programmingDuality results

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

Related Items (7)

Semi-infinite programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ Positively regular vague matrices ⋮ Centered solutions for uncertain linear equations ⋮ Complexity aspects of a semi-infinite optimization problem† ⋮ Duality for inexact semi-infinite linear programming ⋮ Cutting plane algorithms for robust conic convex optimization problems

Cites Work

• Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Erratum
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connections between generalized, inexact and semi-infinite linear programming