Linear Programming with Special Ordered Sets

DOI10.2307/2581933MaRDI QIDQ3040931zbMATH OpenOpenAlexFDO

Authors 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

adapted simplex algorithmconcave objective functionslinear constraintsproduction planningspecial ordered setsspecial structure

Mathematics Subject Classification ID

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

Cited in

(7)

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

This page was built for publication: Linear Programming with Special Ordered Sets

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