Book Notices |
| |
Authors: | Sastry V N Mohideen S Ismail |
| |
Institution: | (1) Department of Mathematics and Computer Applications, Regional Engineering College, Tiruchirappalli, Tamil Nadu, India;(2) Department of Mathematics, Jamal Mohamed College, Tamil Nadu, India |
| |
Abstract: | Finding Pareto-minimum vectors among r given vectors, each of dimension m, is a fundamental problem in multiobjective optimization problems or multiple-criteria decision-making problems. Corley and Moon (Ref. 1) have given an algorithm for finding all the Pareto-minimum paths of a multiobjective network optimization problem from the initial node to any other node. It uses another algorithm by Corley and Moon, which actually computes the Pareto-minimum vectors. We observed that the latter algorithm is incorrect. In this note, we correct the algorithm for computing Pareto-minimum vectors and present a modified algorithm. |
| |
Keywords: | Pareto-minimum vectors multiple objectives network optimization multiple-criteria decision making |
本文献已被 SpringerLink 等数据库收录! |
|