A finitely convergent procedure for facial disjunctive programs

DOI10.1016/0166-218X(82)90071-3zbMath0475.90061MaRDI QIDQ1159568

Hanif D. Sherali, C. M. Shetty

Publication date: 1982

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear constraints; facial disjunctive programs; finitely convergent procedure; logical disjunctive conditions

Mathematics Subject Classification ID

90C05: Linear programming

90C09: Boolean programming

Related Items

Stability in disjunctive optimization II:continuity of the feasible and optimal set, A finite procedure to generate feasible points for the extreme point mathematical programming problem, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, A finite cutting plane method for facial disjunctive programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondominated cuts for disjunctive programs and polyhedral annexation methods
• Quasi-concave minimization subject to linear constraints
• A converse for disjunctive constraints
• Disjunctive programming: Properties of the convex hull of feasible points
• A Cutting-Plane Game for Facial Disjunctive Programs
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• On the generation of deep disjunctive cutting planes
• Polyhedral annexation in mixed integer and combinatorial programming
• Cutting-Planes for Complementarity Constraints
• Polyhedral convexity cuts and negative edge extensions