Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming

DOI10.1287/MNSC.23.5.453zbMath0358.90041OpenAlexW2090839948MaRDI QIDQ4132253

Publication date: 1977

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (61)

Multiple cost coefficients sensitivity theorems of integer linear optimization ⋮ Parametric methods in integer linear programming ⋮ Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems ⋮ Aggregation of constraints in integer programming ⋮ Certain parametric problems of integer convex programming and their approximate solution ⋮ Marginal values in mixed integer linear programming ⋮ Theoretical and algorithmic advances in multi-parametric programming and control ⋮ Real-time personnel re-scheduling after a minor disruption in the retail industry ⋮ An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem ⋮ Stability, parametric, and postoptimality analysis of discrete optimization problems ⋮ Parametric uncapacitated facility location ⋮ Compact representation of near-optimal integer programming solutions ⋮ An exact solution algorithm for integer bilevel programming with application in energy market optimization ⋮ Optimizing high-level nuclear waste disposal within a deep geologic repository ⋮ Low-complexity control of hybrid systems using approximate multi-parametric MILP ⋮ Optimal algorithms for sensitivity analysis in associative multiplication problems ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ Parametric integer linear programming: A synthesis of branch and bound with cutting planes ⋮ General approach to estimating the complexity of postoptimality analysis for discrete optimization problems ⋮ An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems ⋮ On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems ⋮ Parametric nonlinear integer programming: The right-hand side case ⋮ Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities ⋮ A fuzzy set-theoretic method for public facility location ⋮ Parametric mixed-integer 0-1 linear programming: The general case for a single parameter ⋮ A decomposition technique for mixed integer programming problems ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems ⋮ Efficient market-clearing prices in markets with nonconvexities ⋮ An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function ⋮ Fuzzy non-linear integer program by parametric programming approach ⋮ Parametric-objective integer programming using knapsack facets and Gomory cutting planes ⋮ Unnamed Item ⋮ An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function ⋮ A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ Postoptimal Analysis in Nonserial Dynamic Programming ⋮ A comment on ``Grey integer programming: an application to waste management planning under uncertainty by Guo H. Huang, Brian W. Baetz, Gilles G. Patry ⋮ Structural approach to parametric analysis of an IP. On the case of the right-hand side ⋮ Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion ⋮ 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 ⋮ Integer programming duality: Price functions and sensitivity analysis ⋮ A response to ``A comment on `Grey integer programming: an application to waste management planning under uncertainty{'} by Larry Jenkins ⋮ A bi-objective uncapacitated facility location problem ⋮ A contraction for the multiparametric integer linear programming problem ⋮ Enhanced-interval linear programming ⋮ An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study ⋮ A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem ⋮ The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price ⋮ Solution of a parametric integer programming problem ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix ⋮ An algorithm for multiparametric mixed-integer linear programming problems ⋮ A branch-and-bound algorithm for 0-1 parametric mixed integer programming ⋮ Boolean programming problems with fuzzy constraints ⋮ The multiparametric 0-1-integer linear programming problem: A unified approach ⋮ Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities ⋮ An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

This page was built for publication: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming