论文信息 - Some Easy Postoptimality Analysis for Zero-One Programming

Some Easy Postoptimality Analysis for Zero-One Programming

Some easy postoptimality analysis for zero-one programming is developed. First, a procedure is presented for obtaining a set K of 0-1 solutions whose objective function values are within a specified tolerance of the optimum. Then sufficiency conditions for K to contain the optimum of a revised problem are derived. Computational experience with a number of test problems indicates that K can be economically obtained and that the sufficiency tests provide a significant postoptimization capability.

Andris A. Zoltners | Christopher J. Piper | A. Zoltners | C. J. Piper

[1] C. A. Trauth,et al. Integer Linear Programming: A Study in Computational Efficiency , 1969 .

[2] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[3] Kurt Spielberg,et al. Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

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

[5] J. F. Pierce,et al. Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems , 1973 .

[6] Gary M. Roodman. Postoptimality analysis in zero‐one programming by implicit enumeration , 1972 .

[7] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[8] Andris A. Zoltners,et al. Implicit enumeration based algorithms for postoptimizing zero‐one programs , 1975 .

[9] Ronald D. Armstrong,et al. Improved penalty calculations for a mixed integer branch-and-bound algorithm , 1974, Math. Program..

[10] Arthur M. Geoffrion,et al. An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..