Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J Optim Theory Appl (2009) 141: 112 DOI 10.1007/s10957-008-9474-3
 

Summary: J Optim Theory Appl (2009) 141: 112
DOI 10.1007/s10957-008-9474-3
Higher-Order Duality in Nondifferentiable Minimax
Programming with Generalized Type I Functions
I. Ahmad Z. Husain S. Sharma
Published online: 17 December 2008
Springer Science+Business Media, LLC 2008
Abstract A unified higher-order dual for a nondifferentiable minimax programming
problem is formulated. Weak, strong and strict converse duality theorems are dis-
cussed involving generalized higher-order (F,,,d)-Type I functions.
Keywords Nondifferentiable programming Minimax programming Higher-order
duality
1 Introduction
Several authors have shown their interest in developing optimality conditions and du-
ality results for minimax programming problems. Schmitendorf (Ref. [1]) considered
the following minimax programming problem:
(P) Min sup
yY
f (x,y),
s.t. g(x) 0, x Rn

  

Source: Ahmad, Izahr - Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals

 

Collections: Mathematics