A general class of greedily solvable linear programs.
Maurice QueyranneFrits C. R. SpieksmaFabio TardellaPublished in: IPCO (1993)
Keyphrases
- linear program
- special case
- linear programming
- convex functions
- np hard
- semi infinite
- simplex method
- optimal solution
- dynamic programming
- column generation
- primal dual
- stochastic programming
- integer program
- multistage stochastic
- np complete
- linear inequalities
- extreme points
- interior point
- mixed integer linear program
- strongly polynomial