A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem

DOI10.1016/S0377-2217(96)00332-3zbMath0968.90052MaRDI QIDQ1296805

Alejandro Crema

Publication date: 3 August 1999

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

zbMATH Keywords

completenessmixed integer linear programmingparametric linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31)

Related Items (3)

Theoretical and algorithmic advances in multi-parametric programming and control ⋮ An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem ⋮ Parametric mixed-integer 0-1 linear programming: The general case for a single parameter

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming
• Average shadow price in a mixed integer linear programming problem
• Parametric methods in integer linear programming
• Three methods for postoptimal analysis in integer linear programming
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Parametric Mixed Integer Programming: An Application to Solid Waste Management

This page was built for publication: A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem