Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optim Lett (2009) 3:277286 DOI 10.1007/s11590-008-0107-4
 

Summary: Optim Lett (2009) 3:277286
DOI 10.1007/s11590-008-0107-4
ORIGINAL PAPER
Second order duality for minmax fractional
programming
Z. Husain I. Ahmad Sarita Sharma
Received: 23 February 2008 / Accepted: 7 October 2008 / Published online: 31 October 2008
Springer-Verlag 2008
Abstract In the present paper, two types of second order dual models are formu-
lated for a minmax fractional programming problem. The concept of -bonvexity/
generalized -bonvexity is adopted in order to discuss weak, strong and strict converse
duality theorems.
Keywords Minmax programming Fractional programming Second order duality
-bonvexity
1 Introduction
Optimization problems with minmax type functions arise in the design of electronic
circuits, however, minmax fractional problems appear in the formulation of discrete
and continuous rational approximation problems with respect to the Chebyshev norm
[6], in continuous rational games [22], in multiobjective programming [23], in enginee-
ring design as well as in some portfolio selection problems discussed by Bajona-Xandri

  

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

 

Collections: Mathematics