Formulation for a fixed-charge, separable nonlinear production planning problem
Authors:
- 1 September 1983
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 21 (5) , 713-722
Abstract
A production planning problem for which the objective function contains both separable and fixed-charge components is formulated under the assumptions of separable constraint functions and a- minimum production level. It is shown that for this problem, the well known application of the λ separation technique can be extended to allow the separation variables, λ, to represent the fixed charge component as well as the nonlinear components of the objective function. The result is the formulation of an approximating problem that has a degree of solution complexity comparable to that of usual separable programs. An application of such formulation to the electric utility generation scheduling problem is presented.Keywords
This publication has 7 references indexed in Scilit:
- A branch‐and‐bound algorithm for solving fixed charge problemsNaval Research Logistics Quarterly, 1981
- Separable programming as a solution methodology for aggregate production planningInternational Journal of Production Research, 1980
- The pure fixed charge transportation problemNaval Research Logistics Quarterly, 1979
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functionsNaval Research Logistics Quarterly, 1979
- Power system operations scheduling using separable programmingElectric Power Systems Research, 1979
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration ConstraintsA I I E Transactions, 1971