An approximation algorithm for convex multi-objective programming problems

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.50, Iss.3, 2011-07, pp. : 397-416

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

Characterizing strict efficiency for convex multiobjective programming problems

By Gupta Anjana Mehra Aparna Bhatia Davinder

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 265-280

Springer Publishing Company

Access to resources Recommend Favorite

A successive approximation method for solving multi-objective fuzzy optimization problems

By Zhang B.X. Chung B.T.F. Lee Edward T

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 26, Iss. 4, 1997-04 ,pp. : 392-406

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems

By Liu Sanming Feng Enmin

Journal of Global Optimization, Vol. 38, Iss. 4, 2007-08 ,pp. : 653-666

Springer Publishing Company

Access to resources Recommend Favorite

Using traceless genetic programming for solving multi-objective optimization problems

By Oltean Mihai Grosan Crina

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 19, Iss. 3, 2007-09 ,pp. : 227-248

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Method of Fuzzy Multi-objective Nonlinear Programming with GUB Structure by Hybrid Genetic Algorithm

By Sasaki M. Gen M.

International Journal of Smart Engineering System Design, Vol. 5, Iss. 4, 2003-10 ,pp. : 281-288

Taylor & Francis Ltd

Access to resources Recommend Favorite