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

DOI10.1016/0166-218X(84)90022-2MaRDI QIDQ798260zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A closed-form representation of mixed-integer program value functions
• Constructive characterizations of the value function of a mixed-integer program. II
• scientific article; zbMATH DE number 1953200
• Constructing the value function for an integer linear programme over a cone
• La valeur optimale des programmes entiers. (The optimal value of integer programs)

Cites work

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

Cited in

(18)

• Parametric methods in integer linear programming
• The value function of an infinite-horizon single-item lot-sizing problem
• Chvátal closures for mixed integer programming problems
• Optimality certificates for convex minimization and Helly numbers
• On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
• A unified framework for multistage mixed integer linear optimization
• Inference flexibility in Horn clause knowledge bases and the simplex method
• Exact augmented Lagrangian duality for mixed integer convex optimization
• Lattice-free simplices with lattice width \(2d - o(d)\)
• A closed-form representation of mixed-integer program value functions
• Local stability and differentiability of the mean-conditional value at risk model defined on the mixed-integer loss functions
• On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse.
• Constructive characterizations of the value function of a mixed-integer program. II
• A framework for generalized Benders' decomposition and its application to multilevel optimization
• Enumeration and unimodular equivalence of empty delta-modular simplices
• Future paths for integer programming and links to artificial intelligence
• Evaluating mixed-integer programming models over multiple right-hand sides
• Solving stochastic and bilevel mixed-integer programs via a generalized value function

This page was built for publication: Constructive characterizations of the value-function of a mixed-integer program. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798260)