A Benson type algorithm for nonconvex multiobjective programming problems |
| |
| Authors: | Soghra Nobakhtian Narjes Shafiei |
| |
| Affiliation: | 1.Department of Mathematics,University of Isfahan,Isfahan,Iran;2.School of Mathematics,Institute for Research in Fundamental Sciences (IPM),Tehran,Iran |
| |
| Abstract: | 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 (varepsilon )-) nondominated points of NCMOPs. Some numerical examples are presented to clarify the proposed algorithm. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
