Journal
TOP
Volume 25, Issue 2, Pages 271-287Publisher
SPRINGER
DOI: 10.1007/s11750-016-0430-3
Keywords
Multiobjective optimization; Efficient solution; Nondominated point; Approximation algorithm
Categories
Funding
- Center of Excellence Mathematics, University of Shahrekord, Iran
- IPM [94900423]
Ask authors/readers for more resources
In this paper, an approximation algorithm for solving nonconvex multiobjective programming problems (NCMOPs) is presented. We modify Benson's method using cones instead of hyperplanes. This algorithm uses an inner approximation and an outer approximation to generate (weakly) efficient solutions and (weakly -) nondominated points of NCMOPs. Some numerical examples are presented to clarify the proposed algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
