Stability in disjunctive linear optimization I: continuity of the feasible set

DOI10.1080/02331939008843617zbMath0718.90087OpenAlexW2067349605MaRDI QIDQ5750733

Siegfried Helbig

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

parametric programmingupper and lower semicontinuitydisjunctive semi-infinite linear optimizationfeasible-set-mappingparametric mixed- integer optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34) Methods involving semicontinuity and convergence; relaxation (49J45)

Related Items (2)

Topological stability of linear semi-infinite inequality systems ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Unnamed Item
• On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
• Optimization with disjunctive constraints
• Farkas-Minkowski systems in semi-infinite programming
• Stability theorems for infinitely constrained mathematical programs
• Sequential convexification in reverse convex and disjunctive programming
• Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive Programming
• Approximation of the efficient point set by perturbation of the ordering cone

This page was built for publication: Stability in disjunctive linear optimization I: continuity of the feasible set