Parametric-objective integer programming using knapsack facets and Gomory cutting planes

DOI10.1016/0377-2217(87)90143-3MaRDI QIDQ579128zbMATH OpenOpenAlexFDO

Authors Larry Jenkins

Publication date 1987

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(87)90143-3

zbMATH Keywords

Computational resultscutting planeknapsack facetsparametric integer programspost-optimal analysisre-optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Review text

A method for solving parametric integer programs is presented. Fixed integer programs are solved using knapsack facets or a cutting plane algorithm and their number is minimized by post-optimal analysis and re- optimization. Computational results are given.

Recommendations

• Parametric methods in integer linear programming
• scientific article; zbMATH DE number 4202023
• A computational comparison of Gomory and knapsack cuts
• Parametric integer programming in fixed dimension
• Parametric integer programming

Cites work

• Development of a Parametric Generating Procedure for Integer Programming Test Problems
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3709922 (Why is no real title available?)
• scientific article; zbMATH DE number 3564693 (Why is no real title available?)
• Implicit enumeration based algorithms for postoptimizing zero-one programs
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Parameterisation algorithms for the integer linear programs in binary variables
• Parametric Mixed Integer Programming: An Application to Solid Waste Management
• Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
• Postoptimality analysis in zero‐one programming by implicit enumeration
• Solving Large-Scale Zero-One Linear Programming Problems
• Some Easy Postoptimality Analysis for Zero-One Programming

Cited in

(11)

• An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
• The multiparametric 0-1-integer linear programming problem: A unified approach
• An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
• Parametric methods in integer linear programming
• scientific article; zbMATH DE number 4202023 (Why is no real title available?)
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
• Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
• An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• A computational comparison of Gomory and knapsack cuts
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: Parametric-objective integer programming using knapsack facets and Gomory cutting planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579128)