✦ LIBER ✦

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

✍ Scribed by Ching-Feng Wen; Hsien-Chung Wu

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 295 KB
Volume: 49
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-010-9542-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the use of multiple objective linear

On the use of multiple objective linear programming algorithms to solve problems with fractional objectives

✍ J.S.H. Kornbluth 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Using the Cayley transform and finite el

Using the Cayley transform and finite elements to solve linear time dependent problems

✍ J. Peterson 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 523 KB

In this paper the approach of using the Cayley transformation to evaluate the solution of a linear parabolic equation is coupled with standard finite-element methods. The potential advantage of this approach is that the solution at a fixed time is written in terms of a Linear combination of solution

A linear time algorithm to solve the wei

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 379 KB

On the form of solutions to the linear c

On the form of solutions to the linear continuous time programming problem and a conjecture by Tyndall

✍ Benedikt Jóhannesson; Morgan A Hanson 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 263 KB