Error bounds for mixed integer linear optimization problems

DOI10.1007/S10107-015-0872-7MaRDI QIDQ263186zbMATHOpenAlexFDO

Authors Oliver Stein

Publication date 4 April 2016

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

Full work available at URL https://doi.org/10.1007/s10107-015-0872-7

zbMATH Keywords

global error boundgranularitygrid relaxation retractHoffman constantrounding

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Error bounds for mixed integer nonlinear optimization problems
• Bounds on the objective value of feasible roundings
• A feasible rounding approach for mixed-integer optimization problems
• Safe bounds in linear and mixed-integer linear programming
• Approximation properties and tight bounds for constrained mixed-integer optimal control

Cites work

• scientific article; zbMATH DE number 3835772 (Why is no real title available?)
• scientific article; zbMATH DE number 1328979 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• 50 Years of Integer Programming 1958-2008
• A Condition Number for Differentiable Convex Inequalities
• An Application of Error Bounds for Convex Programming in a Linear Space
• Approximations to Solutions to Systems of Linear Inequalities
• Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
• Error bounds for analytic systems and their applications
• Error bounds for solutions of linear equations and inequalities
• Extension of Hoffman’s Error Bound to Polynomial Systems
• Geometric algorithms and combinatorial optimization
• Global Regularity Theorems
• Global error bounds for piecewise convex polynomials
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
• Sensitivity theorems in integer linear programming
• Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
• Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
• Some proximity and sensitivity results in quadratic integer programming
• Testing additive integrality gaps
• The distance to a polyhedron
• The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program

Cited in

(11)

• Error bounds and finite termination for constrained optimization problems
• New characterizations of Hoffman constants for systems of linear constraints
• Granularity in nonlinear mixed-integer optimization
• Error bounds for mixed integer nonlinear optimization problems
• A feasible rounding approach for mixed-integer optimization problems
• Bounds on the objective value of feasible roundings
• Approximation properties and tight bounds for constrained mixed-integer optimal control
• A posteriori error bounds in linear programming aggregation
• Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
• Convergence and error bound for perturbation of linear programs
• The gap function: evaluating integer programming models over multiple right-hand sides

This page was built for publication: Error bounds for mixed integer linear optimization problems

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