Loading...
Please wait, while we are loading the content...
Similar Documents
A Linear Bound on the Integrality Gap for Sum-up Rounding in the Presence of Vanishing Constraints
| Content Provider | Semantic Scholar |
|---|---|
| Author | Manns, Paul Kirches, Christian |
| Copyright Year | 2018 |
| Abstract | In this article we consider the integrality gap between a relaxed continuous control trajectory and an integer feasible one that is constructively obtained in linear runtime by a family of sum-up-rounding algorithms. Such algorithms are typically invoked when solving Mixed-Integer Optimal Control Problems (MIOCPs) and serve to construct integer feasible approximations from optimal solutions of a particular relaxation. We give a constructive proof of a bound on the integrality gap in the presence of additional constraints on the discrete control. Our bound is linear in both the time discretization granularity and the number of discrete choices of the control. This result completes recent work on the approximation of feasible points of the relaxed problem by points of the combinatorial problem. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://spp1962.wias-berlin.de/preprints/077.pdf |
| Alternate Webpage(s) | http://www.optimization-online.org/DB_FILE/2018/04/6580.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
