A RECURRENCE METHOD FOR SIMPLE CONTINUOUS LINEAR PROGRAMMING PROBLEMS

In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A practical and efficient method for finding an approximate optimal value and optimal solution of (SP) is presented. The main work of computing...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of the Chinese Institute of Industrial Engineers Ročník 26; číslo 2; s. 147 - 155
Hlavní autoři:	Wen, Ching-Feng, Wu, Yan-Kuen, Lur, Yung-Yih
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis Group 01.01.2009
Témata:	continuous linear programming problems recurrence method
ISSN:	1017-0669, 2151-7606
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!

Popis
Shrnutí:	In this paper, we discuss a special class of continuous linear programming problems which can be called simple continuous linear programming problems (SP). A practical and efficient method for finding an approximate optimal value and optimal solution of (SP) is presented. The main work of computing an approximate optimal value in the provided method is only to solve finite linear programming problems by using recurrence relations. Furthermore, a simple algorithm can be employed not only to easily solve the (SP) problem but also to provide an error bound of optimal value as well. Some numerical examples are given to implement the algorithm.
ISSN:	1017-0669 2151-7606
DOI:	10.1080/10170660909509131