Paper Info
Title
Duality for nonsmooth semi-infinite programming problems.
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.
Year
DOI
Venue
2012
10.1007/s11590-010-0240-8
Optimization Letters
Keywords
Field
DocType
Duality, Semi-infinite programming, Nonsmooth programming, Generalized convexity
Converse,Mathematical optimization,Weak duality,Dual polyhedron,Mathematical analysis,Semi-infinite programming,Inequality,Duality (optimization),Strong duality,Wolfe duality,Mathematics
Journal
Volume
Issue
ISSN
6
2
1862-4480
Citations 
PageRank 
References 
5
0.47
10
Authors
3
Name
Order
Citations
PageRank
S. K. Mishra1457.37
M. Jaiswal281.56
Le Thi Hoai An3103880.20