Characterization of facets for multiple right-hand choice linear programs

DOI10.1007/BFb0120925zbMath0449.90070MaRDI QIDQ3896844

Ellis L. Johnson

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

polyhedraconvexitypolar setcutting planessubadditivityfacetsdual setmultiple right-hand choice linear programs

Mathematics Subject Classification ID

Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Related Items (9)

Subadditive approaches in integer programming ⋮ Two row mixed-integer cuts via lifting ⋮ Theoretical challenges towards cutting-plane selection ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ Sufficiency of cut-generating functions ⋮ Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ Cut-Generating Functions and S-Free Sets ⋮ A geometric approach to cut-generating functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex Analysis
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Some continuous functions related to corner polyhedra
• Cut search methods in integer programming

This page was built for publication: Characterization of facets for multiple right-hand choice linear programs