A closed-form representation of mixed-integer program value functions

DOI10.1007/BF01585994zbMath0846.90080MaRDI QIDQ1914070

Yanyan Li

Publication date: 3 October 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

value functionsrational constraint coefficients

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (8)

Evaluating mixed-integer programming models over multiple right-hand sides ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Mixed-integer bilevel representability ⋮ Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming ⋮ A Gilmore-Gomory construction of integer programming value functions ⋮ The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Constructive characterizations of the value-function of a mixed-integer program. I
• The b-hull of an integer program
• The value function of a mixed integer program: I
• Cutting-plane theory: Algebraic methods
• The value function of a mixed integer program. II
• Edmonds polytopes and a hierarchy of combinatorial problems
• Sensitivity theorems in integer linear programming
• Integer programming duality: Price functions and sensitivity analysis
• The value function of an integer program
• On the existence of optimal solutions to integer and mixed-integer programming problems

This page was built for publication: A closed-form representation of mixed-integer program value functions