In formulating linear programming problems, analysts tend to include constraints that are not binding at the optimal solution for fear of excluding necessary constraints. The inclusion of such constraints does not alter the optimum solutions, but may require many additional iterations to be...

This paper describes the Criss-Cross Method of solving linear programming problems. The method, a primal-dual scheme, normally begins with a problem solution that is neither primal nor dual feasible, and generates an optimal feasible solution in a finite number of iterations. Convergence of the...

In this paper a man-machine interactive mathematical programming method is presented for solving the multiple criteria problem involving a single decision maker. It is assumed that all decision-relevant criteria or objective functions are concave functions to be maximized, and that the...

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

Management science and decision science have grown exponentially since midcentury. Two closely-related fields central to this growth are multiple criteria decision making (MCDM) and multiattribute utility theory (MAUT). This paper comments on the history of MCDM and MAUT and discusses topics we...

In this paper we develop a new conditional penalty for the fixed charge transportation problem. This penalty is stronger than both the Driebeek penalties and the Lagrangean penalties of Cabot and Erenguc. Computational testing shows that the use of these penalties leads to significant reductions...