Optimization with disjunctive constraints

zbMath0437.90052MaRDI QIDQ1141585

C. M. Shetty, Hanif D. Sherali

Publication date: 1980

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

algorithmslinear complementarity problemdualityhyperplanefacetspolyhedral setscutting plane methodsKuhn-Tucker conditionscardinality constrained linear programdisjunctive cut principledisjunctive programsfinitely convergent algorithmsgeneralized lattice point problemlinearity spacemixed integer cutspolyhedral annexation techniqueprimal-dual linear programmingrelaxed programsubgradient optimization methodsvalid cutzero-line linear integer programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items (51)

Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ A branch and bound algorithm for extreme point mathematical programming problems ⋮ Facet inequalities from simple disjunctions in cutting plane theory ⋮ A finite cutting plane method for facial disjunctive programs ⋮ Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems ⋮ Conic mixed-integer rounding cuts ⋮ A finite procedure to generate feasible points for the extreme point mathematical programming problem ⋮ A simplification for some disjunctive formulations ⋮ A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints ⋮ Configuration of airspace sectors for balancing air traffic controller workload ⋮ On optimality and duality theorems of nonlinear disjunctive fractional minmax programs ⋮ Quadratic programming problems and related linear complementarity problems ⋮ Solving linear optimization over arithmetic constraint formula ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Two-term disjunctions on the second-order cone ⋮ A hierarchy of relaxations for linear generalized disjunctive programming ⋮ A computational study of the cutting plane tree algorithm for general mixed-integer linear programs ⋮ A finite cutting plane method for solving linear programs with an additional reverse convex constraint ⋮ Foundation-penalty cuts for mixed-integer programs. ⋮ An algorithm for disjunctive programs ⋮ A finite algorithm for solving the generalized lattice point problem ⋮ Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs ⋮ A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Lagrangean duality for facial programs with applications to integer and complementarity problems ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ Relaxations for probabilistically constrained programs with discrete random variables ⋮ Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs ⋮ Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization ⋮ RLT: A unified approach for discrete and continuous nonconvex optimization ⋮ Lift-and-project for mixed 0-1 programming: recent progress ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ Application of disjunctive programming to the linear complementarity problem ⋮ Stability in disjunctive linear optimization I: continuity of the feasible set ⋮ DEA with efficiency classification preserving conditional convexity ⋮ An extreme-point-ranking algorithm for the extreme-point mathematical programming problem ⋮ On the optimality of nonlinear fractional disjunctive programming problems ⋮ Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints ⋮ A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification ⋮ On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set ⋮ Note on solving linear complementarity problems as jointly constrained bilinear programs ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ Tight bounds for capacities ⋮ Projection, lifting and extended formulation integer and combinatorial optimization ⋮ Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

This page was built for publication: Optimization with disjunctive constraints