期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 256, 期 1, 页码 17-23出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2016.05.026
关键词
Multiple objective programming; Pareto optimality; Projected subgradient method
资金
- postdoctoral fellowship in the Postgraduate Program in Computer Science at the Federal University of Piaui - CAPES
- CNPq [301625-2008, 485205-2013]
- PRONEX-Optimization (FAPERJ/CNPq)
- PROPESQ/UFPI
In this paper, we propose an algorithm for solving multiobjective minimization problems on nonempty closed convex subsets of the Euclidean space. The proposed method combines a reflection technique for obtaining a feasible point with a projected subgradient method. Under suitable assumptions, we show that the sequence generated using this method converges to a Pareto optimal point of the problem. We also present some numerical results. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据