The Duality Theory of Generalized Separated Continuous Linear Programming

In this paper, we consider a kind of new problem called generalized separated continuous linear programming (GSCLP), motivated by the great modeling power of it. By using discretization methodology, we prove that the strong duality holds between GSCLP and its dual under some mild condition.

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 International Conference on Management and Service Science s. 1 - 5
Hlavní autor: Xiaoqing Wang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2010
Témata:
Approximation algorithms
Biological system modeling
Economic indicators
Heuristic algorithms
Job shop scheduling
Linear programming
ISBN:9781424453252, 1424453259
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 consider a kind of new problem called generalized separated continuous linear programming (GSCLP), motivated by the great modeling power of it. By using discretization methodology, we prove that the strong duality holds between GSCLP and its dual under some mild condition.
ISBN:9781424453252
1424453259
DOI:10.1109/ICMSS.2010.5576304