A note on duality in disjunctive programming

DOI10.1007/BF00933095MaRDI QIDQ1229803zbMATH OpenOpenAlexFDO

Authors E. 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)

Cites work

• Cutting-planes for programs with disjunctive constraints
• Disjunctive programming: Properties of the convex hull of feasible points
• scientific article; zbMATH DE number 3545380 (Why is no real title available?)
• scientific article; zbMATH DE number 3248665 (Why is no real title available?)
• Polyhedral annexation in mixed integer and combinatorial programming
• Trivial integer programs unsolvable by branch-and-bound

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229803)