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...

We develop an interactive method for multiple objective linear programming based on aspiration levels of a decision maker. The method assumes an unknown pseudoconcave preference structure of a decision maker throughout the decision process, and the decision maker's ability to select a preferred...