Name
Abstract | ||
|---|---|---|
In this paper the linear two-level problem is considered. The problem is reformulated to an equivalent quasiconcave minimization problem, via a reverse convex transformation. A branch and bound algorithm is developed which takes the specific structure into account and combines an outer approximation technique with a subdivision procedure. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF01098360 | J. Global Optimization |
Keywords | Field | DocType |
Linear two-level program,global optimization,Stackelberg game,quasiconcave minimization,branch and bound,outer approximation,subdivision procedure | Mathematical optimization,Branch and bound,Global optimization,Branch and cut,Quasiconvex function,Regular polygon,Subdivision,Minification,Stackelberg competition,Mathematics | Journal |
Volume | Issue | ISSN |
4 | 3 | 0925-5001 |
Citations | PageRank | References |
10 | 0.97 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoang Tuy | 1 | 497 | 60.46 |
| Athanasios Migdalas | 2 | 330 | 27.26 |
| Peter Värbrand | 3 | 247 | 22.37 |