A note on duality in disjunctive programming

DOI10.1007/BF00933095zbMath0336.90037OpenAlexW2042759771MaRDI QIDQ1229803

Egon Balas

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933095

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items (10)

Duality in disjunctive programming via vector optimization ⋮ Parametric disjunctive programming: One-sided differentiability of the value function ⋮ A strong duality theorem for the minimum of a family of convex programs ⋮ Mixed logical-linear programming ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Quasiconvex minimization on a locally finite union of convex sets ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ Duality in disjunctive linear fractional programming ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set ⋮ An alternative explanation of disjunctive formulations

Cites Work

• Unnamed Item
• Unnamed Item
• Disjunctive programming: Properties of the convex hull of feasible points
• Cutting-planes for programs with disjunctive constraints
• Polyhedral annexation in mixed integer and combinatorial programming
• Trivial integer programs unsolvable by branch-and-bound

This page was built for publication: A note on duality in disjunctive programming