A Class of Linear Programs Solvable by Coordinate-Wise Minimization.
Tomás DlaskTomás WernerPublished in: LION (2020)
Keyphrases
- linear program
- convex functions
- linear programming
- objective function
- np hard
- semi infinite
- stochastic programming
- simplex method
- special case
- optimal solution
- linear programming problems
- column generation
- mixed integer linear program
- mixed integer
- primal dual
- np complete
- multistage stochastic
- strongly polynomial
- feasible solution
- interior point
- extreme points
- lower bound
- integer program
- linear inequalities