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.

Saved in:
Bibliographic Details
Published in:2010 International Conference on Management and Service Science pp. 1 - 5
Main Author: Xiaoqing Wang
Format: Conference Proceeding
Language:English
Published: IEEE 01.08.2010
Subjects:
Approximation algorithms
Biological system modeling
Economic indicators
Heuristic algorithms
Job shop scheduling
Linear programming
ISBN:9781424453252, 1424453259
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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