Duality for inexact semi-infinite linear programming

Duality for inexact semi-infinite linear programming

0.00 Avg rating0 Votes
Article ID: iaor20052802
Country: United Kingdom
Volume: 54
Issue: 1
Start Page Number: 1
End Page Number: 25
Publication Date: Feb 2005
Journal: Optimization
Authors: , ,
Keywords: duality
Abstract:

The aim of this work is to generalize strong duality theorems for inexact linear programming and to derive duality results for inexact semi-definite 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.

Reviews

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