Computing tight bounds via piecewise linear functions through the example of circle cutting problems

This paper discusses approximations of continuous and mixed-integer non-linear optimization problems via piecewise linear functions. Various variants of circle cutting problems are considered, where the non-overlap of circles impose a non-convex feasible region. While the paper is written in an “eas...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical methods of operations research (Heidelberg, Germany) Jg. 84; H. 1; S. 3 - 57
1. Verfasser:	Rebennack, Steffen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2016 Springer Nature B.V
Schlagworte:	Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Computation Cutting Cutting parameters Didacticism Electronics Integer programming Linear programming Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Optimization Optimization algorithms Or in the Classroom Quadratic programming Studies Circle cutting Non-linear programming (NLP) Quadratically constrained programming (QCP) Logarithmic formulation Non-convex optimization Global optimization Mixed-integer linear programming (MILP) Incremental formulation Outer approximation Piecewise linear functions Inner approximation
ISSN:	1432-2994, 1432-5217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!