A monotonic optimization approach for solving strictly quasiconvex multiobjective programming problems
Year: 2020
Type: article
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.
DOI: 10.3233/jifs-179690
Authors: Tran Ngoc Thang, Vijender Kumar Solanki, Tuan Anh Dao, Nguyen Thi Ngoc Anh, Pham Van Hai
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3012034569
