Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems

A Dinkelbach-type algorithm is proposed in this paper to solve a class of continuous-time linear fractional programming problems. We shall transform this original problem into a continuous-time non-fractional programming problem, which unfortunately happens to be a continuous-time nonlinear programm...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 49; H. 2; S. 237 - 263
Hauptverfasser:	Wen, Ching-Feng, Wu, Hsien-Chung
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.02.2011 Springer Nature B.V
Schlagworte:	Algorithms Approximation Computer Science Linear programming Mathematical functions Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Real Functions Studies Dinkelbach-type algorithm Continuous-time linear fractional programming problems Approximate solutions Weak duality Weak-star convergence
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!