The value function of a mixed integer program: I

DOI10.1016/0012-365X(77)90028-0zbMath0364.90074OpenAlexW2075451161WikidataQ127814051 ScholiaQ127814051MaRDI QIDQ1241180

C. E. Blair, Robert G. Jeroslow

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90028-0

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (36)

Parametric methods in integer linear programming ⋮ On structure and stability in stochastic programs with random technology matrix and complete integer recourse ⋮ A closed-form representation of mixed-integer program value functions ⋮ The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides ⋮ Evaluating mixed-integer programming models over multiple right-hand sides ⋮ A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse ⋮ Weak Continuity of Risk Functionals with Applications to Stochastic Programming ⋮ The b-hull of an integer program ⋮ The Distributions of Functions Related to Parametric Integer Optimization ⋮ Sensitivity theorems in integer linear programming ⋮ Mixed-integer bilevel representability ⋮ Risk Aversion in Two-Stage Stochastic Integer Programming ⋮ Quantitative stability of fully random mixed-integer two-stage stochastic programs ⋮ Exact augmented Lagrangian duality for mixed integer linear programming ⋮ On deviation measures in stochastic integer programming ⋮ Risk aversion for an electricity retailer with second-order stochastic dominance constraints ⋮ Subadditive duality in multiobjective integer linear programming ⋮ A polyhedral characterization of the inverse-feasible region of a mixed-integer program ⋮ Two-stage robust mixed integer programming problem with objective uncertainty ⋮ The value function of a mixed integer program: I ⋮ Minimal inequalities ⋮ Distances between optimal solutions of mixed-integer programs ⋮ Cutting-plane theory: Algebraic methods ⋮ The value function of a mixed integer program. II ⋮ On duality for Boolean programming ⋮ A Gilmore-Gomory construction of integer programming value functions ⋮ Integer programming duality: Price functions and sensitivity analysis ⋮ An elementary survey of general duality theory in mathematical programming ⋮ Duality in mathematics and linear and integer programming ⋮ On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse. ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ The value function of an integer program ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ A primal dual integer programming algorithm ⋮ Conditional value-at-risk in stochastic programs with mixed-integer recourse ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Mixed integer minimization models for piecewise-linear functions of a single variable
• The value function of a mixed integer program: I
• Some polyhedra related to combinatorial problems
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
• Implicit enumeration based algorithms for postoptimizing zero-one programs
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Some continuous functions related to corner polyhedra, II

This page was built for publication: The value function of a mixed integer program: I