Constructive characterizations of the value-function of a mixed-integer program. I

DOI10.1016/0166-218X(84)90022-2zbMath0545.90079OpenAlexW4210397891MaRDI QIDQ798260

C. E. Blair, Robert G. Jeroslow

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90022-2

zbMATH Keywords

value functionindicator functions

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Parametric methods in integer linear programming ⋮ Lattice-free simplices with lattice width \(2d - o(d)\) ⋮ Unnamed Item ⋮ A closed-form representation of mixed-integer program value functions ⋮ Evaluating mixed-integer programming models over multiple right-hand sides ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ The value function of an infinite-horizon single-item lot-sizing problem ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Chvátal closures for mixed integer programming problems ⋮ Optimality certificates for convex minimization and Helly numbers ⋮ Future paths for integer programming and links to artificial intelligence ⋮ On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse. ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Constructive characterizations of the value function of a mixed-integer program. II ⋮ Inference flexibility in Horn clause knowledge bases and the simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• Constructive characterizations of the value function of a mixed-integer program. II
• Partitioning procedures for solving mixed-variables programming problems
• Mixed integer minimization models for piecewise-linear functions of a single variable
• Cutting-plane theory: Algebraic methods
• The value function of a mixed integer program. II
• Integer and mixed-integer programming models: General properties
• Some polyhedra related to combinatorial problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Modelling with integer variables
• Minimal inequalities
• On Cutting Planes
• Integer programming duality: Price functions and sensitivity analysis
• The value function of an integer program
• An Exact Penalty Method for Mixed-Integer Programs
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the foundations of linear and integer linear programming I
• Some Basis Theorems for Integral Monoids
• Some continuous functions related to corner polyhedra, II