Duality for nonsmooth semi‐infinite programming problems

Duality for nonsmooth semi‐infinite programming problems

0.00 Avg rating0 Votes
Article ID: iaor2012653
Volume: 6
Issue: 2
Start Page Number: 261
End Page Number: 271
Publication Date: Feb 2012
Journal: Optimization Letters
Authors: , ,
Keywords: programming: mathematical
Abstract:

This paper deals with nonsmooth semi‐infinite programming problem which in recent years has become an important field of active research in mathematical programming. A semi‐infinite programming problem is characterized by an infinite number of inequality constraints. We formulate Wolfe as well as Mond‐Weir type duals for the nonsmooth semi‐infinite programming problem and establish weak, strong and strict converse duality theorems relating the problem and the dual problems. To the best of our knowledge such results have not been done till now.

Reviews

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