Linear Programming with Special Ordered Sets

DOI10.2307/2581933zbMath0526.90071OpenAlexW4255017131MaRDI QIDQ3040931

Ralph D. Snyder

Publication date: 1984

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581933

zbMATH Keywords

production planninglinear constraintsspecial structureconcave objective functionsspecial ordered setsadapted simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Production models (90B30) Methods of successive quadratic programming type (90C55)

Related Items

A simplex algorithm for piecewise-linear programming I: Derivation and proof, Piecewise-linear programming: The compact (CPLP) algorithm, Unnamed Item, Generating cuts in integer programming with families of special ordered sets, Solving multi-choice linear programming problems by interpolating polynomials, On the calculation of true and pseudo penalties in multiple choice integer programming, Piecewise lexicographic programming: A new model for practical decision problems