A cutting plane method for bilevel linear programming with interval coefficients.
Aihong RenYuping WangPublished in: Ann. Oper. Res. (2014)
Keyphrases
- linear programming
- cutting plane method
- interior point methods
- linear program
- primal dual
- cutting plane
- semidefinite programming
- column generation
- linear programming problems
- integer programming
- dynamic programming
- feasible solution
- quadratic programming
- optimal solution
- interior point
- objective function
- semidefinite
- linear combination
- wavelet coefficients
- valid inequalities
- nonlinear programming
- cutting plane algorithm
- np hard
- extreme points
- integer program
- mixed integer
- constraint propagation
- lagrangian relaxation
- branch and bound