New Closedness Results for Efficient Sets in Multiple Objective Mathematical Programming

Author： Benson H.P.   Leitmann E.G.  

Publisher： Academic Press

ISSN： 0022-247X

Source： Journal of Mathematical Analysis and Applications, Vol.238, Iss.1, 1999-10, pp. : 277-296

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Generalised convexity and duality in multiple objective programming

By  

Bulletin of the Australian Mathematical Society, Vol. 39, Iss. 2, 1989-04 ,pp. : 287-299

Cambridge University Press

Access to resources Recommend Favorite

SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS

By  

ANZIAM Journal, Vol. 56, Iss. 1, 2014-10 ,pp. : 91-103

Cambridge University Press

Access to resources Recommend Favorite

Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions

By Preda V.  

Journal of Mathematical Analysis and Applications, Vol. 288, Iss. 2, 2003-12 ,pp. : 365-382

Elsevier

Access to resources Recommend Favorite

On Ratio Invexity in Mathematical Programming

By Khan Z.A.   Hanson M.A.  

Journal of Mathematical Analysis and Applications, Vol. 205, Iss. 2, 1997-01 ,pp. : 330-336

Academic Press

Access to resources Recommend Favorite

On Mixed Duality in Mathematical Programming

By Bector C.R.   Chandra S.    

Journal of Mathematical Analysis and Applications, Vol. 259, Iss. 1, 2001-07 ,pp. : 346-356

Academic Press

Access to resources Recommend Favorite