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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical methods of operations research (Heidelberg, Germany) Ročník 84; číslo 1; s. 3 - 57
Hlavní autor:	Rebennack, Steffen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2016 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!