A numerical method for nonconvex multi-objective optimal control problems
Files
(Published version)
Date
2014
Authors
Kaya, C.Y.
Maurer, H.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Computational Optimization and Applications, 2014; 57(3):685-702
Statement of Responsibility
Conference Name
Abstract
A numerical method is proposed for constructing an approximation of the Pareto front of nonconvex multi-objective optimal control problems. First, a suitable scalarization technique is employed for the multi-objective optimal control problem. Then by using a grid of scalarization parameter values, i.e., a grid of weights, a sequence of single-objective optimal control problems are solved to obtain points which are spread over the Pareto front. The technique is illustrated on problems involving tumor anti-angiogenesis and a fed-batch bioreactor, which exhibit bang–bang, singular and boundary types of optimal control. We illustrate that the Bolza form, the traditional scalarization in optimal control, fails to represent all the compromise, i.e., Pareto optimal, solutions.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2013 Springer
Access Condition Notes: Postprint only available on Open Access