Name
Abstract | ||
|---|---|---|
In this paper we consider the problem of optimizing a piecewise-linear objective function over a non-convex domain. In particular we do not allow the solution to lie in the interior of a prespecified region R. We discuss the geometrical properties of this problems and present algorithms based on combinatorial arguments. In addition we show how we can construct quite complicated shaped sets R while maintaining the combinatorial properties. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1023/A:1008367608172 | Journal of Global Optimization |
Keywords | Field | DocType |
Reverse convex constraints,Geometric approach,Discretization,Piecewise linear programs | Discretization,Mathematical optimization,Global optimization,Mathematical analysis,Piecewise,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 2 | 1573-2916 |
Citations | PageRank | References |
1 | 0.39 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan Nickel | 1 | 427 | 41.70 |
| Anita Schöbel | 2 | 791 | 72.30 |