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žené v:
Podrobná bibliografia
Vydané v:2010 International Conference on Management and Service Science s. 1 - 5
Hlavný autor: Xiaoqing Wang
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.08.2010
Predmet:
Approximation algorithms
Biological system modeling
Economic indicators
Heuristic algorithms
Job shop scheduling
Linear programming
ISBN:9781424453252, 1424453259
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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