Numerical method for solving a class of continuous-time linear fractional programming problems

Ching Feng Wen*, Yung Yih Lur, Sy Ming Guu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we discuss a class of infinite-dimensional optimization problems called continuous-time linear fractional programming problems (FP). We provide a discrete approximation procedure to find numerical solutions of (FP) and to establish the estimation for the error bound of approximate solutions. Moreover, in order to reduce the consumption of computational time of solving large scale finite-dimensional linear programs, we further develop recurrence algorithms to take over the conventional methods.

Original languageEnglish
Title of host publicationProceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009
Pages761-765
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009 - Sanya, Hainan, China
Duration: 24 04 200926 04 2009

Publication series

NameProceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009
Volume2

Conference

Conference2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009
Country/TerritoryChina
CitySanya, Hainan
Period24/04/0926/04/09

Fingerprint

Dive into the research topics of 'Numerical method for solving a class of continuous-time linear fractional programming problems'. Together they form a unique fingerprint.

Cite this