{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:47:56Z","timestamp":1777704476257,"version":"3.51.4"},"reference-count":22,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:00:00Z","timestamp":1583884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,5,29]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3233\/jifs-179690","type":"journal-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T13:04:10Z","timestamp":1584104650000},"page":"6053-6063","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":7,"title":["A monotonic optimization approach for solving strictly quasiconvex multiobjective programming problems"],"prefix":"10.1177","volume":"38","author":[{"given":"Tran Ngoc","family":"Thang","sequence":"first","affiliation":[{"name":"School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Hanoi, Vietnam"}]},{"given":"Vijender Kumar","family":"Solanki","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, CMR Institute of Technology, Hyderabad, TS, India"}]},{"given":"Tuan Anh","family":"Dao","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Uppsala University, Uppsala, Sweden"}]},{"given":"Nguyen","family":"Thi Ngoc Anh","sequence":"additional","affiliation":[{"name":"School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Hanoi, Vietnam"}]},{"given":"Pham","family":"Van Hai","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"}]}],"member":"179","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"AvrielM. DiewertW.E. SchaibleS. and ZangI. Generalized Concavity Plenum Press New York (1988)."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017527329601"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008215702611"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOTA.0000026129.07165.5a"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/mcda.369"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-010-9588-7"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/09075648X"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.07.013"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s001860200217"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.32.143"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-016-0430-3"},{"key":"e_1_3_2_14_2","first-page":"195","volume-title":"Generalized Convexity in Vector Optimization","author":"Luc D.T.","year":"2005","unstructured":"LucD.T., Generalized Convexity in Vector Optimization, in: Handbook of Generalized Convexity and Generalized Monotonicity, Springer-Verlag, New York, (2005), pp. 195\u2013136."},{"key":"e_1_3_2_15_2","unstructured":"MangasarianO.L. Nonlinear Programming McGraw-Hill New York (1969)."},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","article-title":"Approximation methods in multiobjective programming","volume":"126","author":"Ruzika S.","year":"2005","unstructured":"RuzikaS. and WiecekM.M., Approximation methods in multiobjective programming, Journal of Optimization Theory and Applications126 (2005), 473\u2013501.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-130824"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Stancu-MinasianI.M. Fractional Programming: Theory Methods and Applications Kluwer Academic Publishers Netherlands (1997).","DOI":"10.1007\/978-94-009-0035-6_2"},{"key":"e_1_3_2_19_2","first-page":"277","article-title":"Normal sets, polyblocks and monotonic optimization","volume":"27","author":"Tuy H.","year":"1999","unstructured":"TuyH., Normal sets, polyblocks and monotonic optimization, Vietnam Journal of Mathematics27 (1999), 277\u2013300.","journal-title":"Vietnam Journal of Mathematics"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/S1052623499359828","article-title":"Monotonic Optimization: Problems and Solution Approaches","volume":"2","author":"Tuy H.","year":"2000","unstructured":"TuyH., Monotonic Optimization: Problems and Solution Approaches, SIAM Journal on Optimization2 (2000), 464\u2013494.","journal-title":"SIAM Journal on Optimization"},{"key":"e_1_3_2_21_2","first-page":"39","volume-title":"Monotonic Optimization: Branch and Cuts Methods","author":"Tuy H.","year":"2005","unstructured":"TuyH., Al-KhayyalF. and ThachP.T., Monotonic Optimization: Branch and Cuts Methods, in: Essays and Surveys on Global Optimization, Springer-Verlag, New York, (2005), pp. 39\u201378."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-15712"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","unstructured":"WiecekM.M. EhrgottM. and EngauA. Continuous multiobjective programming in: Multiple criteria decision analysis: State of the art surveys Oper Res Manag Sci Springer New York (2016) pp. 739\u2013815.","DOI":"10.1007\/978-1-4939-3094-4_18"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179690","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179690","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:18Z","timestamp":1777455678000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,11]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5,29]]}},"alternative-id":["10.3233\/JIFS-179690"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179690","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,11]]}}}