A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
In this paper a branch-and-bound algorithm is proposed for finding a global minimum to a Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints (MPECs), which incorporates disjunctive cuts for computing lower bounds and employs a Complementarity Active-Set Algorithm for c...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Language: | eng |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10216/96247 |
| Country: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/96247 |