Integer Programming Post-Optimal Analysis with Cutting Planes
From MaRDI portal
Publication:3885525
DOI10.1287/mnsc.25.1.64zbMath0442.90067OpenAlexW2048233275MaRDI QIDQ3885525
Publication date: 1979
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.25.1.64
cutting planesoptimality testingall-integer linear programmingcoefficient changes in the right hand sideinteger programming post-optimal analysismixed-integer linear programming problems
Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)
Related Items (23)
An Algorithm for solving the Integer Linear Fractional Programs ⋮ Adding activities to the dual instead of cuts to the primal problem ⋮ Parametric methods in integer linear programming ⋮ A unified approach for price directive decomposition procedures in integer programming ⋮ Stability, parametric, and postoptimality analysis of discrete optimization problems ⋮ Parametric uncapacitated facility location ⋮ Interactive approach to bi-level integer multi-objective fractional programming problem ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ Parametric integer linear programming: A synthesis of branch and bound with cutting planes ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ Bicriterion integer linear fractional programs with parameters in the objective functions ⋮ Fuzzy non-linear integer program by parametric programming approach ⋮ Parametric-objective integer programming using knapsack facets and Gomory cutting planes ⋮ A computational comparison of Gomory and knapsack cuts ⋮ Sensitivity analysis of the optimal assignment. ⋮ Structural approach to parametric analysis of an IP. On the case of the right-hand side ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Stability set for integer linear goal programming ⋮ An iterative goal programming approach for solving fuzzy multiobjective integer linear programming problems ⋮ Solution of a parametric integer programming problem ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ A branch-and-bound algorithm for 0-1 parametric mixed integer programming ⋮ Sensitivity analysis of mixed integer programs: An application to environmental policy making
This page was built for publication: Integer Programming Post-Optimal Analysis with Cutting Planes