首页 | 本学科首页   官方微博 | 高级检索  
     


Approximation Methods in Multiobjective Programming
Authors:S. Ruzika  M. M. Wiecek
Affiliation:(1) Diplommathematiker, Fachbereich Mathematik, Universität Kaiserslautern, Kaiserslautern, Germany;(2) Professor, Department of Mathematical Sciences, Clemson University, Clemson, SC, USA
Abstract:
Approaches to approximate the efficient set and Pareto set of multiobjective programs are reviewed. Special attention is given to approximating structures, methods generating Pareto points, and approximation quality. The survey covers more than 50 articles published since 1975.His work was supported by Deutsche Forschungsgemeinschaft, Grant HA 1795/7-2.Her work was done while on a sabbatical leave at the University of Kaiserslautern with support of Deutsche Forschungsgemeinschaft, Grant Ka 477/24-1.
Keywords:Multiobjective programming  approximation  efficient sets  Pareto sets  nondominated sets.
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号