Constraint relaxation in approximate linear programs.
Marek PetrikShlomo ZilbersteinPublished in: ICML (2009)
Keyphrases
- linear program
- constraint relaxation
- constraint satisfaction
- linear programming
- semi infinite
- stochastic programming
- linear inequalities
- primal dual
- simplex method
- constraint optimization
- optimal solution
- interior point methods
- column generation
- dynamic programming
- mixed integer
- np hard
- extreme points
- integer program
- linear programming problems
- objective function
- multistage
- strongly polynomial