Evaluating mixed-integer programming models over multiple right-hand sides

DOI10.1016/j.orl.2023.05.004zbMath1525.90281MaRDI QIDQ6047695

Temitayo Ajayi, Andrew J. Schaefer, Rachael M. Alfant

Publication date: 12 September 2023

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

value functionmixed-integer programmingsuperadditive duality

Mathematics Subject Classification ID

Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality for mixed-integer convex minimization
• Two-stage quadratic integer programs with stochastic right-hand sides
• Constructive characterizations of the value-function of a mixed-integer program. I
• The value function of a mixed integer program: I
• The value function of a mixed integer program. II
• An abstract model for branching and its application to mixed integer programming
• A polyhedral characterization of the inverse-feasible region of a mixed-integer program
• A closed-form representation of mixed-integer program value functions
• Distances between optimal solutions of mixed-integer programs
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Minimal inequalities
• Integer programming duality: Price functions and sensitivity analysis
• The value function of an integer program
• The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• THE STRONG MINKOWSKI FARKAS-WEYL THEOREM FOR VECTOR SPACES OVER ORDERED FIELDS

This page was built for publication: Evaluating mixed-integer programming models over multiple right-hand sides