Beating Simplex for Fractional Packing and Covering Linear Programs.
Christos KoufogiannakisNeal E. YoungPublished in: FOCS (2007)
Keyphrases
- linear program
- simplex method
- linear programming
- simplex algorithm
- nelder mead
- stochastic programming
- optimal solution
- column generation
- linear programming problems
- semi infinite
- packing problem
- primal dual
- dynamic programming
- np hard
- interior point methods
- multistage stochastic
- extreme points
- feasible solution
- integer program
- mixed integer
- linear inequalities
- mixed integer linear program
- objective function
- quadratic programming
- mathematical programming
- integer programming
- convex functions
- semidefinite programming
- lower bound
- scheduling problem
- market equilibrium