![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
Abstract
A branch and bound algorithm is developed in this paper for a class of discrete resource allocation problems with many constraints. The algorithm exploits certain properties of the objective function, and has been shown to be much faster and thus far more efficient than both dynamic programming and exhaustive search methods. The strength of this optimization procedure lies not only in the ease with which an appropriate solution can be identified for evaluation, but, more importantly, in the simplicity and rapidity with which upper bounds for the entire problem as well as for any subproblems can be calculated. A detailed description of the solution procedure is presented in the paper; and a numerical example to illustrate the application of the algorithm is also provided.
This research was partially supported by a 1975 Faculty Research Associateship, and also benefited from a Seminar on Optimization jointly supported by Dean K. Vogt, Dr. C. Mott and Dr. S. Halpern, of Bowling Green State University.
This research was partially supported by a 1975 Faculty Research Associateship, and also benefited from a Seminar on Optimization jointly supported by Dean K. Vogt, Dr. C. Mott and Dr. S. Halpern, of Bowling Green State University.