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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 49; no. 2; pp. 237 - 263
Main Authors:	Wen, Ching-Feng, Wu, Hsien-Chung
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2011 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!