An optimal local approximation algorithm for max-min linear programs.
Patrik FloréenJoel KaasinenPetteri KaskiJukka SuomelaPublished in: SPAA (2009)
Keyphrases
- max min
- linear program
- optimal solution
- dynamic programming
- linear programming
- min max
- learning algorithm
- strongly polynomial
- worst case
- simplex method
- np hard
- extreme points
- simplex algorithm
- nelder mead
- objective function
- exhaustive search
- convex optimization
- stochastic programming
- optimization problems
- state space
- computational complexity