On complexity of finding strong-weak solutions in bilevel linear programming.
Tomás LagosOleg A. ProkopyevPublished in: Oper. Res. Lett. (2023)
Keyphrases
- linear programming
- feasible solution
- optimal solution
- linear program
- np hard
- computational issues
- objective function
- primal dual
- linear programming problems
- mathematical programming
- convex programming
- solution quality
- nonlinear programming
- quadratic programming
- space complexity
- integer programming
- column generation
- network flow
- memory requirements
- optimization problems
- worst case
- interior point methods
- neural network
- real time
- constraint propagation
- simulated annealing
- efficient solutions
- reinforcement learning
- learning algorithm
- data sets