Classes of linear programs solvable by coordinate-wise minimization.
Tomás DlaskTomás WernerPublished in: Ann. Math. Artif. Intell. (2022)
Keyphrases
- linear program
- np hard
- linear programming
- objective function
- stochastic programming
- convex functions
- special case
- optimal solution
- semi infinite
- primal dual
- simplex method
- column generation
- multistage stochastic
- extreme points
- np complete
- mixed integer linear program
- linear programming problems
- nelder mead
- computational complexity
- dynamic programming
- interior point methods
- mixed integer
- approximation algorithms
- linear inequalities
- strongly polynomial
- simplex algorithm
- feasible solution
- integer program