Duality for inexact semi-infinite linear programming

被引：7
|
作者：
Gómez, JA
Bosch, PJ
Amaya, J [1 ]
机构：
[1] Univ Chile, Dept Ingn Matemat, Santiago, Chile
[2] Univ Chile, Ctr Modelamiento Matemat, Santiago, Chile
来源：
OPTIMIZATION | 2005年 / 54卷 / 01期
关键词：
semi-infinite linear programming; duality; Dubovitskii-Milyutin approach;
D O I：
10.1080/02331930412331286595
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The aim of this work is to generalize strong duality theorems for inexact linear programming and to derive duality results for inexact semi-infinite programming problems. We give a detailed proof of the general result, using the Dubovitskii-Milyutin approach. The last section contains applications to inexact problems and a few comments for further developments.
引用
收藏
页码：1 / 25
页数：25
相关论文
共 50 条
12345