Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

MP
2016

favoriteEmaildiscussreport

59views Information Technology» more MP 2016»

Error bounds for mixed integer linear optimization problems

8 years 7 months ago

Error bounds for mixed integer linear optimization problems

Download www.optimization-online.org

We introduce computable a-priori and a-posteriori error bounds for optimality and feasibility of a point generated as the rounding of an optimal point of the LP relaxation of a mixed integer linear optimization problem. Treating the mesh size of integer vectors as a parameter allows us to study the eﬀect of diﬀerent ‘granularities’ in the discrete variables on the error bounds. Our analysis mainly bases on the construction of a so-called grid relaxation retract. Relations to proximity results and the integer rounding property are highlighted.

Oliver Stein

Real-time Traffic

Information Technology | MP 2016 |

claim paper

Related Content

» On the problem of spurious eigenvalues in the approximation of linear elliptic problems in...

» ANDOR BranchandBound for Solving Mixed Integer Linear Programming Problems

» On the knapsack closure of 01 Integer Linear Programs

» ConstraintBased Optimization with the Minimax Decision Criterion

» An algorithmic framework for convex mixed integer nonlinear programs

» Genetic algorithms and mixed integer linear programs for optimal strategies in a students ...

» Mixed Integer Linear Programming for Exact FiniteHorizon Planning in Decentralized Pomdps

» Parametric tabusearch for mixed integer programs

» Activeconstraint variable ordering for faster feasibility of mixed integer linear programs

» Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs

Post Info
More Details (n/a)

Added	08 Apr 2016
Updated	08 Apr 2016
Type	Journal
Year	2016
Where	MP
Authors	Oliver Stein

Comments (0)