An improved surrogate constraints method for separable nonlinear integer programming

An improved surrogate constraints method for solving separable nonlinear integer programming problems with multiple constraints is presented. The surrogate constraints method is very eective in solving problems with multiple constraints. The method solves a succession of surrogate constraints problems having a single constraint instead of the original multiple constraint problem. A surrogate problem with an optimal multiplier vector solves the original problem exactly if there is no duality gap. However, the surrogate constraints method often has a duality gap, that is it fails to find an exact solution to the original problem. The modification proposed closes the surrogate duality gap. The modification solves a succession of target problems that enumerates all solutions hitting a particular target. The target problems are produced by using an optimal surrogate multiplier vector. The computational results show that the modification is very eective at closing the surrogate gap of multiple constraint problems.

[1]  J. B. Rosen,et al.  Construction of nonlinear programming test problems , 1965 .

[2]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[3]  David G. Luenberger,et al.  Quasi-Convex Programming , 1968 .

[4]  Yuji Nakagawa,et al.  A Heuristic Method for Determining Optimal Reliability Allocation , 1977, IEEE Transactions on Reliability.

[5]  Hiroshi Kamada,et al.  Surrogate Constraints Algorithm for Reliability Optimization Problems with Multiple Constraints , 1981, IEEE Transactions on Reliability.

[6]  Yuji Nakagawa,et al.  Smart greedy procedure for solving a nOnlinear knapsack class of reliability optimization problems , 1995 .

[7]  R. Nauss.  The 0–1 knapsack problem with multiple choice constraints☆ , 1978 .

[8]  Yuji Nakagawa.  A new method for discrete optimization problems , 1990 .

[9]  Prabhakant Sinha,et al.  The Multiple-Choice Knapsack Problem , 1979, Oper. Res..

[10]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[11]  Ronald L. Rardin,et al.  A new surrogate dual multiplier search procedure , 1987 .

[12]  Bala Shetty,et al.  The Nonlinear Resource Allocation Problem , 1995, Oper. Res..

[13]  Yuji Nakagawa,et al.  Surrogate Constraints Algorithm for Reliability Optimization Problems with Two Constraints , 1981, IEEE Transactions on Reliability.

[14]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[15]  M. W. Cooper.  A Survey of Methods for Pure Nonlinear Integer Programming , 1981 .

[16]  M. E. Dyer,et al.  A branch and bound algorithm for solving the multiple-choice knapsack problem , 1984 .

[17]  Stephen D. Roberts,et al.  Implementing a portable FORTRAN Uniform (0,1) generator , 1983 .

[18]  Thomas L. Morin,et al.  A hybrid approach to discrete mathematical programming , 2015, Math. Program..

[19]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[20]  Yuji Nakagawa,et al.  Modular Approach for Solving Nonlinear Knapsack Problems , 1999 .

[21]  Katsuhisa Ohno,et al.  Decision support system for the composition of the examination problem , 1995 .

[22]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[23]  Yuji Nakagawa,et al.  Reliability Optimization with Multiple Properties and Integer Variables , 1979, IEEE Transactions on Reliability.

[24]  Martin Dyer.  Calculating surrogate constraints , 1980, Math. Program..

[25]  Ronald D. Armstrong,et al.  A computational study of a multiple-choice knapsack algorithm , 1983, TOMS.

[26]  Ross J. W. James,et al.  Enumeration Methods for Repeatedly Solving Multidimensional Knapsack Sub-Problems , 2005, IEICE Trans. Inf. Syst..

[27]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..