Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.
Sebastian BerndtKlaus JansenAlexandra LassotaPublished in: CoRR (2020)
Keyphrases
- linear program
- lower bound
- linear programming
- extreme points
- stage stochastic programs
- optimal solution
- np hard
- upper bound
- semi infinite
- objective function
- simplex method
- mixed integer
- sensitivity analysis
- primal dual
- lower and upper bounds
- branch and bound
- worst case
- column generation
- integer solution
- branch and bound algorithm
- stochastic programming
- mixed integer linear program
- integer program
- interior point
- linear programming problems
- interior point methods
- nelder mead
- inventory routing
- continuous relaxation
- convex functions
- feasible solution
- simplex algorithm
- linear inequalities
- market equilibrium