Discrete Optimization with Nonseparable Functions; Determination of a Kit Composition for War Readiness Spare Parts.
Abstract
This research is intended to improve the author's previous algorithm for solving an optimization problem connected with the determination of the composition of a War Readiness Spares Kit. The problem was formulated as a discrete minimization model with two nonlinear constraint functions, of which one is nonseparable. The solution algorithm is modified in several aspects including selection of a good initial kit composition, improvements in convergence toward a global optimum and refinements in programming techniques. A branch-and-bound technique and a univariate search method are incorporated into the algorithm and a numerical example is given. Computational results show that the revised algorithm is improved in computational efficiency. However, some factors must be considered in order to enhance the capability of the algorithm for solving practical problems. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1979
- Accession Number
- ADA072565
Entities
People
- Der-san Chen
Organizations
- University of Alabama