A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming

E-ISSN： 1029-4937|30|3|634-642

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.30, Iss.3, 2015-05, pp. : 634-642

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

Finding a Minimal Efficient Solution of a Convex Multiobjective Program

By Lin Z.H. Zhu D.L. Sheng Z.P.

Journal of Optimization Theory and Applications, Vol. 118, Iss. 3, 2003-09 ,pp. : 587-600

Springer Publishing Company

Access to resources Recommend Favorite

A constraint shifting homotopy method for general non-linear programming

By Yang Li Yu Bo Xu Qing

Optimization, Vol. 63, Iss. 4, 2014-04 ,pp. : 585-600

Taylor & Francis Ltd

Access to resources Recommend Favorite

Truncated aggregate homotopy method for nonconvex nonlinear programming

By Xiao Y. Xiong H.J. Yu B.

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 160-176

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient Solution Concepts and Their Relations in Stochastic Multiobjective Programming

By Caballero R. Cerdá E. Muñoz M.M. Rey L. Stancu-Minasian I.M.

Journal of Optimization Theory and Applications, Vol. 110, Iss. 1, 2001-07 ,pp. : 53-74

Springer Publishing Company

Access to resources Recommend Favorite

Nonsmooth multiobjective programming and constraint qualifications

By Golestani M. Nobakhtian S.

Optimization, Vol. 62, Iss. 6, 2013-06 ,pp. : 783-795

Taylor & Francis Ltd

Access to resources Recommend Favorite