Showing 1 - 10 of 13
We develop an interactive method for multiple objective linear programming based on aspiration levels of a decision … Tchebycheff procedure for multiple objective programming. Math. Prog. 26 326--344.) and Reeves and Franz (Reeves, G. R., L. Franz …. 1985. A simplified interactive multiple objective linear programming procedure. Comp. & Oper. Res. 12 589--601.). All three …
Persistent link: https://www.econbiz.de/10009214458
In this paper, we develop a Lagrangean relaxation-based heuristic procedure to generate near-optimal solutions to very-large-scale capacitated lot-sizing problems (CLSP) with setup times and limited overtime. Our computational results show that large problems involving several thousand products...
Persistent link: https://www.econbiz.de/10009197895
Persistent link: https://www.econbiz.de/10000090538
Persistent link: https://www.econbiz.de/10001996900
Persistent link: https://www.econbiz.de/10002763722
Persistent link: https://www.econbiz.de/10002380423
Persistent link: https://www.econbiz.de/10002150217
Persistent link: https://www.econbiz.de/10002247772
Persistent link: https://www.econbiz.de/10002452087
Persistent link: https://www.econbiz.de/10002905885