Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming.
Meijia HanWenxing ZhuPublished in: CoRR (2022)
Keyphrases
- linear programming
- linear program
- semi infinite
- simplex method
- optimal solution
- interior point methods
- primal dual
- column generation
- feasible solution
- multistage stochastic
- approximate dynamic programming
- dynamic programming
- objective function
- linear programming problems
- stochastic programming
- interior point
- mixed integer
- linear inequalities
- integer programming
- nonlinear programming
- simplex algorithm
- mixed integer linear program
- integer program
- network flow
- quadratic programming
- mathematical programming
- np hard
- lp relaxation
- data envelopment analysis
- semidefinite programming
- quadratic program
- lagrangian relaxation
- average cost