{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:45:35Z","timestamp":1759333535880,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51722701"],"award-info":[{"award-number":["51722701"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2817571","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T18:05:27Z","timestamp":1521655527000},"page":"19560-19567","source":"Crossref","is-referenced-by-count":1,"title":["Sparsity Prevention Pivoting Method for Linear Programming"],"prefix":"10.1109","volume":"6","author":[{"given":"Peiqiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiyuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9116-7487","authenticated-orcid":false,"given":"Canbing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1376-4531","authenticated-orcid":false,"given":"Bin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijia","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baling","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2008.02.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00077-1"},{"key":"ref12","first-page":"373","article-title":"A polynomial time algorithm for linear programming","volume":"4","author":"kachiyan","year":"1979","journal-title":"Soviet Math Dokl"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020406"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.2.103"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2005.11.033"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.06.080"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.07.030"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3934\/naco.2011.1.1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.11.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/9780471703778"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.12.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.01.013"},{"key":"ref7","first-page":"339","article-title":"Maximization of a linear function of variables subject to linear inequalities","author":"dantzig","year":"1951","journal-title":"Activity Analysis of Production and Allocation"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2016.11.020"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2015.2503425"},{"key":"ref9","first-page":"157","article-title":"A new two-phase method for the fuzzy primal simplex algorithm","volume":"8","author":"edalatpanah","year":"2012","journal-title":"Rev Math Pure Appl"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(98)00024-8"},{"key":"ref22","first-page":"67","article-title":"Mathematical Multi-objective Model for the selection of a portfolio of investment in the Mexican Stock Market","volume":"2","author":"zavala-d\u00edaz","year":"2010","journal-title":"Adv Inf Sci Serv Sci"},{"key":"ref21","first-page":"1009","article-title":"Research on goal programming algorithm based on lingo","volume":"8","author":"yang","year":"2013","journal-title":"J Converg Inf Technol"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.09.011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.183"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08320785.pdf?arnumber=8320785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:52Z","timestamp":1642004152000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8320785\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2817571","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}