Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems

We describe a practical procedure for finding all solutions to a parametric family of nonseparable quadratic integer programs that differ in their resource availabilities. We outline a new method for optimizing these quadratic integer programs, and demonstrate how to solve a sequence of such problems parametrized against the right-hand-side of a single constraint. Several methods for accelerating the basic procedure are presented, and computational experience is provided.

[1]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[2]  Richard D. McBride,et al.  The factorization approach to large-scale linear programming , 1976, Math. Program..

[3]  Jean-Michel Gauthier,et al.  Experiments in mixed-integer linear programming using pseudo-costs , 1977, Math. Program..

[4]  F. Glover IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[5]  H. Noltemeier Sensitivitätsanalyse bei diskreten linearen Optimierungsproblemen , 1970 .

[6]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[7]  R. McBride,et al.  An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .

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

[9]  A. M. Geoffrion Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[10]  V. Bowman Sensitivity Analysis in Linear Integer Programming , 1972 .

[11]  D. J. Laughhunn Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..

[12]  H. Weingartner Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[13]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[14]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[15]  Willard I. Zangwill,et al.  Media Selection by Decision Programming , 1976 .

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

[17]  Hamdy A. Taha,et al.  A Balasian-Based Algorithm for Zero-One Polynomial Programming , 1972 .

[18]  Arthur M. Geoffrion,et al.  Parametric and Postoptimality Analysis in Integer Linear Programming , 1976 .

[19]  R. Nauss,et al.  Parametric integer programming , 1979 .

[20]  Jonathan S. Yormark,et al.  Optimal Real Estate Portfolios , 1979 .

[21]  Dan J. Laughhunn,et al.  Capital Expenditure Programming and Some Alternative Approaches to Risk , 1971 .

[22]  Lawrence J. Watters Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[23]  R. E. Marsten,et al.  Parametric Integer Programming: The Right-Hand-Side Case , 2018 .

[24]  Andris A. Zoltners,et al.  Some Easy Postoptimality Analysis for Zero-One Programming , 1976 .

[25]  R. E. Marsten,et al.  An Algorithm for Nonlinear Knapsack Problems , 1976 .

[26]  Nancy L. Jacob A Limited-Diversification Portfolio Selection Model for the Small Investor , 1974 .

[27]  M. Radke,et al.  Sensitivity Analysis in Discrete Optimization , 1975 .

[28]  James C. T. Mao,et al.  An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital Budgeting , 1968 .