A Profit-maximizing Plant-loading Model with Demand Fill-rate Constraints

DOI10.1057/jors.1989.175zbMath0684.90045OpenAlexW1982290432MaRDI QIDQ4735020

Sangwon Moon

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1057/jors.1989.175

zbMATH Keywords

Benders' decompositionintegrated network structurepiecewise linear concave cost functioncapacitated production facilitiesplant product-mix loading problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonlinear programming (90C30) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (2)

New facets for the two-stage uncapacitated facility location polytope ⋮ A production and maintenance planning model for the process industry

Uses Software

• MINOS

This page was built for publication: A Profit-maximizing Plant-loading Model with Demand Fill-rate Constraints