In this paper we present a class of nondifferentiable optimization problems: seim-infinite minimax problems which arise from engineering design. Two algorithms for solving the problems are constructe
Starting with the substance of the cutting-stock problem, a new method to that problem is developed, that is, converting two-dimensional layout into onedimensional layout and converting overall optim