Linear programming in measure spaces

Linear programming in measure spaces

0.00 Avg rating0 Votes
Article ID: iaor19942413
Country: Germany
Volume: 29
Start Page Number: 141
End Page Number: 156
Publication Date: Jun 1994
Journal: Optimization
Authors: ,
Keywords: semi-infinite programming
Abstract:

This paper studies a linear programming problem in measure spaces (LPM). Several results are obtained. First, the optimal value of LPM can be equal to the optimal value of the dual problem (DLPM), but the solution of DLPM may not exist in its feasible region. Second, the relations between the optimal solution of LPM and the extreme point of the feasible region of LPM are discussed. In order to investigate the conditions under which a feasible solution becomes an extremal point, the inequality constraint of LPM is transformed to an equality constraint. Third, the LPM can be reformulated to be a general capacity problem (GCAP) or a linear semi-infinite programming problem (LSIP=SIP), and under appropriate restrictions, the algorithms developed by the authors in earlier papers are applicable for developing an approximation scheme for the optimal solution of LPM.

Reviews

Required fields are marked *. Your email address will not be published.