Stability in disjunctive optimization II:continuity of the feasible and optimal set
From MaRDI portal
Publication:4764595
DOI10.1080/02331939408844006zbMath0819.90108OpenAlexW2030975215MaRDI QIDQ4764595
Publication date: 8 May 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939408844006
Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary conditions for upper semicontinuity in parametric semi-infinite programming
- Stability of best rational Chebyshev approximation
- Duality in disjunctive linear fractional programming
- Optimization with disjunctive constraints
- Facial disjunctive programs and sequences of cutting-planes
- A finitely convergent procedure for facial disjunctive programs
- Stability theorems for infinitely constrained mathematical programs
- A note on duality in disjunctive programming
- Mixed integer minimization models for piecewise-linear functions of a single variable
- A converse for disjunctive constraints
- The value function of a mixed integer program: I
- Duality in disjunctive programming via vector optimization
- Convexity cuts for multiple choice problems
- Sequential convexification in reverse convex and disjunctive programming
- Integer and mixed-integer programming models: General properties
- Cutting-planes for programs with disjunctive constraints
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Nonconvex Quadratic Programming via Generalized Polars
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Facet inequalities from simple disjunctions in cutting plane theory
- A Cutting-Plane Game for Facial Disjunctive Programs
- Rational Mixed-Integer and Polyhedral Union Minimization Models
- On the generation of deep disjunctive cutting planes
- Continuity properties in semi-infinite parametric linear optimization
- Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems
- Cutting-Planes for Complementarity Constraints
- Disjunctive Programming
- An Introduction to the Theory of Cutting-Planes
- Application of disjunctive programming to the linear complementarity problem
- Convex Analysis
- Convexity Cuts and Cut Search
- Stability in disjunctive linear optimization I: continuity of the feasible set
