Formulation for a fixed-charge, separable nonlinear production planning problem

DOI10.1080/00207548308942405zbMath0547.90039OpenAlexW2041650441MaRDI QIDQ3339648

No author found.

Publication date: 1983

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548308942405

zbMATH Keywords

production planningfixed-chargeset-up costsapproximating linear programelectric utility generationminimum production levelsnonlinear separable, disjunctive, mathematical programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Boolean programming (90C09)

Cites Work

• A branch-and-bound algorithm for solving fixed charge problems
• The pure fixed charge transportation problem
• An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
• Unnamed Item

This page was built for publication: Formulation for a fixed-charge, separable nonlinear production planning problem