{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:32:45Z","timestamp":1720693965799},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0167-6377(02)00158-x","type":"journal-article","created":{"date-parts":[[2002,10,16]],"date-time":"2002-10-16T21:46:23Z","timestamp":1034804783000},"page":"281-288","source":"Crossref","is-referenced-by-count":3,"title":["An extension of the fundamental theorem of linear programming"],"prefix":"10.1016","volume":"30","author":[{"given":"A.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Gedlaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Holder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00158-X_BIB1","unstructured":"H. Greenberg, Mathematical Programming Glossary, World Wide Web, http:\/\/www.cudenver.edu\/~hgreenbe\/glossary\/glossary.html, 1996\u20132001."},{"key":"10.1016\/S0167-6377(02)00158-X_BIB2","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1989"},{"key":"10.1016\/S0167-6377(02)00158-X_BIB3","series-title":"Real Analysis","author":"Royden","year":"1988"},{"key":"10.1016\/S0167-6377(02)00158-X_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1017583617249","article-title":"An algorithm for linearly constrained piecewise lexicographic programming problems","volume":"111","author":"Ukovish","year":"2001","journal-title":"J. Optim. Theory Appl."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770200158X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770200158X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T06:51:35Z","timestamp":1554619895000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763770200158X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S016763770200158X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00158-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}