{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:36:07Z","timestamp":1774280167601,"version":"3.50.1"},"reference-count":45,"publisher":"Informa UK Limited","issue":"2","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871196]"],"award-info":[{"award-number":["11871196]"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1080\/00207160.2024.2407887","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T01:49:06Z","timestamp":1727315346000},"page":"262-279","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["An outcome space algorithm for solving general linear multiplicative programming"],"prefix":"10.1080","volume":"102","author":[{"given":"Yanzhen","family":"Zhang","sequence":"first","affiliation":[{"name":"Henan Normal University","place":["Xinxiang, People's Republic of China"]}]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[{"name":"Henan Normal University","place":["Xinxiang, People's Republic of China"]},{"name":"North China University of Water Resources and Electric Power","place":["Zhengzhou, People's Republic of China"]}]}],"member":"301","published-online":{"date-parts":[[2024,9,25]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01299449"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-007-9323-9"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004657629105"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10287-023-00471-1"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-009-0289-2"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2013.852548"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.11.002"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/03052159508941259"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.11.111"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11596448_100"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2024.2371041"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.na.2008.02.005"},{"key":"e_1_3_3_14_1","first-page":"1","article-title":"An efficient outer space algorithm for generalized linear multiplicative programming problem","volume":"99","author":"Jiao H.","year":"2020","unstructured":"H. Jiao, W. Wang, R. Chen, Y. Shang, and J. Yin, An efficient outer space algorithm for generalized linear multiplicative programming problem, IEEE. Access. 99 (2020), pp. 1\u20131.","journal-title":"IEEE. Access."},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0117-1"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580893"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00253808"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02282050"},{"key":"e_1_3_3_19_1","unstructured":"H. Konno and Y. Yajima Solving rank two bilinear programs by parametric simplex algorithms. Technical Report IHSS Report 90-17 Institute of Human And Social Sciences Tokyo Institute of Technology 1990."},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90052-I"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2015.11.009"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0436-2"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-020-01065-7"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1889(97)00032-8"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00121658"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.264"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-009-9460-9"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.03.042"},{"key":"e_1_3_3_29_1","first-page":"309","article-title":"Alternative bounding applications for the global optimization of various engineering design problems","volume":"9","author":"Quesada I.","year":"1996","unstructured":"I. Quesada and I.E. Grossmann, Alternative bounding applications for the global optimization of various engineering design problems, Global Optim. Eng. Des. Nonconvex Optim. Appl. 9 (1996), pp. 309\u2013331.","journal-title":"Global Optim. Eng. Des. Nonconvex Optim. Appl."},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.4.680"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024700901538"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02192573"},{"key":"e_1_3_3_33_1","first-page":"1","article-title":"A criterion space algorithm for solving linear multiplicative programming problems","volume":"2023","author":"Shen P.","year":"2023","unstructured":"P. Shen, Y. Deng, and D. Wu, A criterion space algorithm for solving linear multiplicative programming problems, Numer. Algorithms. 2023 (2023), pp. 1\u201323.","journal-title":"Numer. Algorithms."},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-018-1378-z"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00919-7"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2023.115100"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-023-01277-w"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2016.1269765"},{"key":"e_1_3_3_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.114080"},{"issue":"1","key":"e_1_3_3_41_1","article-title":"A global optimization approach for solving generalized nonlinear multiplicative programming problem","volume":"2014","author":"Yang L.","year":"2014","unstructured":"L. Yang, P. Shen, and Y. Pei, A global optimization approach for solving generalized nonlinear multiplicative programming problem, Abstr. Appl. Anal. 2014(1) (2014), pp. 641909.","journal-title":"Abstr. Appl. Anal."},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2951515"},{"key":"e_1_3_3_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.116035"},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-2984-9"},{"key":"e_1_3_3_45_1","article-title":"Global optimization for generalized linear multiplicative programming using convex relaxation","volume":"2018","author":"Zhao Y.","year":"2018","unstructured":"Y. Zhao and T. Zhao, Global optimization for generalized linear multiplicative programming using convex relaxation, Math. Prob. Eng. 2018 (2018), pp. 9146309.","journal-title":"Math. Prob. Eng."},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10255-015-0456-6"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2024.2407887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T19:14:07Z","timestamp":1770405247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2024.2407887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,25]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.1080\/00207160.2024.2407887"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2024.2407887","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,25]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-06-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-18","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}