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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 49; číslo 2; s. 237 - 263
Hlavní autori:	Wen, Ching-Feng, Wu, Hsien-Chung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.02.2011 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!