求解一类凸多目标规划最小弱有效解的填充函数法 A Filled Function Method of Finding Weak Efficient Mi-nimizer for Convex Multi-Objective Optimization

Author：张莹徐应涛

Publisher：汉斯出版社

ISSN： 2160-7605

Source： Pure Mathematics, Vol.01, Iss.02, 2011-07, pp. : 149-155

Access to resources Favorite

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

Use of Metamodels in the Multi-Objective Optimization of Mechanical Structures with Uncertainties

By Ghanmi S.

International Journal for Computational Methods in Engineering Science and Mech, Vol. 8, Iss. 5, 2007-09 ,pp. : 283-302

Taylor & Francis Ltd

Access to resources Recommend Favorite

NBI-RPRGM for Multi-objective Optimization Design of Bio-Processes

ESAIM: Proceedings, Vol. 20, Iss. issue, 2007-01 ,pp. : 118-128

Edp Sciences

Access to resources Recommend Favorite

A convex analysis approach to multi-material topology optimization

By Clason Christian Kunisch Karl

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 50, Iss. 6, 2016-11 ,pp. : 1917-1936

Edp Sciences

Access to resources Recommend Favorite

DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS

ANZIAM Journal, Vol. 56, Iss. 2, 2014-10 ,pp. : 160-178

Cambridge University Press

Access to resources Recommend Favorite

Multi-objective Virtual Machine Placement for Load Balancing

By Fang Feng

ITM Web of conferences, Vol. 11, Iss. issue, 2017-05 ,pp. : 01011-01011

Edp Sciences

Access to resources Recommend Favorite