Tight local approximation results for max-min linear programs
Patrik FloréenMarja HassinenPetteri KaskiJukka SuomelaPublished in: CoRR (2008)
Keyphrases
- linear program
- max min
- linear programming
- stage stochastic programs
- convex functions
- min max
- semi infinite
- column generation
- lower bound
- stochastic programming
- simplex method
- dynamic programming
- primal dual
- optimal solution
- mixed integer
- np hard
- linear programming problems
- hill climbing
- integer program
- approximation algorithms
- objective function
- mixed integer linear program
- upper bound
- worst case
- extreme points
- strongly polynomial
- simplex algorithm
- linear inequalities
- market equilibrium
- reinforcement learning
- learning algorithm
- artificial neural networks
- robust optimization
- search space
- genetic algorithm
- mathematical programming