Affiliations: [a] School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Hanoi, Vietnam | [b] Department of Computer Science and Engineering, CMR Institute of Technology, Hyderabad, TS, India
| [c] Department of Information Technology, Uppsala University, Uppsala, Sweden
| [d] School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam
Correspondence:
[*]
Corresponding author. Pham Van Hai, School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam. E-mail: [email protected].
Abstract: In this article, we use a monotonic optimization approach to propose an outcome-space outer approximation by copolyblocks for solving strictly quasiconvex multiobjective programming problems which include many classes of captivating problems, for example when the criterion functions are nonlinear fractional. After the algorithm is terminated, with any given tolerance, an approximation of the weakly efficient solution set is obtained containing the whole weakly efficient solution set of the problem. The algorithm is proved to be convergent and it is suitable to be implemented in parallel using convex programming tools. Some computational experiments are reported to show the accuracy and efficiency of the algorithm.
