A finitely convergent procedure for facial disjunctive programs

DOI10.1016/0166-218X(82)90071-3MaRDI QIDQ1159568zbMATH OpenFDO

Authors Hanif D. Sherali, C. M. Shetty

Publication date 1982

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

zbMATH Keywords

linear constraintsfacial disjunctive programsfinitely convergent procedurelogical disjunctive conditions

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3545380 (Why is no real title available?)
• scientific article; zbMATH DE number 3559278 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• A Cutting-Plane Game for Facial Disjunctive Programs
• A converse for disjunctive constraints
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Cutting-Planes for Complementarity Constraints
• Disjunctive programming: Properties of the convex hull of feasible points
• Nondominated cuts for disjunctive programs and polyhedral annexation methods
• On the generation of deep disjunctive cutting planes
• Polyhedral annexation in mixed integer and combinatorial programming
• Polyhedral convexity cuts and negative edge extensions
• Quasi-concave minimization subject to linear constraints

Cited in

(4)

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

This page was built for publication: A finitely convergent procedure for facial disjunctive programs

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