Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems

This article proposes a practical computational procedure to solve a class of continuous-time linear fractional programming problems by designing a discretized problem. Using the optimal solutions of proposed discretized problems, we construct a sequence of feasible solutions of continuous-time line...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Numerical functional analysis and optimization Ročník 33; číslo 1; s. 80 - 129
Hlavní autoři:	Wen, Ching-Feng, Wu, Hsien-Chung
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Taylor & Francis Group 01.01.2012 Taylor & Francis
Témata:	Approximate solutions Calculus of variations and optimal control Continuous-time linear fractional programming problems Exact sciences and technology Mathematical analysis Mathematics Sciences and techniques of general use Strong duality Weak convergence Weak duality Strong duality Continuous-time linear fractional programming problems Error estimation Weak duality Continuous time Linear time Duality 90C26 46N 10 Algorithm Approximate solutions Weak convergence Optimal solution
ISSN:	0163-0563, 1532-2467
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!