A note on a modified simplex approach for solving bilevel linear programming problems.
Manoel B. CampêloSusana ScheimbergPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- linear programming problems
- linear programming
- simplex algorithm
- simplex method
- linear program
- primal dual
- column generation
- implicit enumeration
- feasible solution
- nonlinear programming
- interior point
- interior point methods
- optimal solution
- np hard
- integer programming
- semidefinite programming
- multiple objectives
- quadratic programming
- convergence rate
- dynamic programming
- special case
- objective function
- mixed integer
- neural network
- optimization problems
- scheduling problem
- optimality conditions