Showing papers on "Multi-objective optimization published in 1968"
01 Jun 1968
TL;DR: In this paper, a branch and bound algorithm is rigorously developed which can be applied to the optimization problems of interest, and a rounding operation is defined, which provides a powerful rejection rule and permits the calculation, at each stage of the solution process, of an upper bound and a feasible solution in addition to the usual lower bound.
Abstract: : The purpose of the work is to formulate and solve certain optimization problems arising in the fields of engineering economics, scarce resource allocation, and transportation systems planning. The scope and structure of optimization theory is presented in order to place subsequent work in proper perspective. A branch and bound algorithm is rigorously developed which can be applied to the optimization problems of interest. A rounding operation is defined, which provides a powerful rejection rule and permits the calculation, at each stage of the solution process, of an upper bound and a feasible solution in addition to the usual lower bound.