Some Easy Postoptimality Analysis for Zero-One Programming

DOI10.1287/MNSC.22.7.759zbMath0325.90048OpenAlexW2066532999MaRDI QIDQ4090129

Christopher J. Piper, Andris A. Zoltners

Publication date: 1976

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.22.7.759

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (14)

Parametric methods in integer linear programming ⋮ Stability, parametric, and postoptimality analysis of discrete optimization problems ⋮ Parametric uncapacitated facility location ⋮ Parametric integer linear programming: A synthesis of branch and bound with cutting planes ⋮ Parametric nonlinear integer programming: The right-hand side case ⋮ Parametric-objective integer programming using knapsack facets and Gomory cutting planes ⋮ Discrete right hand side parametrization for linear integer programs ⋮ Structural approach to parametric analysis of an IP. On the case of the right-hand side ⋮ Stability aspects of the traveling salesman problem based on \(k\)-best solutions ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Solution of a parametric integer programming problem ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ Sensitivity analysis of mixed integer programs: An application to environmental policy making ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

This page was built for publication: Some Easy Postoptimality Analysis for Zero-One Programming