{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:14:58Z","timestamp":1772759698645,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0305-0548(96)00055-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"353-365","source":"Crossref","is-referenced-by-count":6,"title":["An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points"],"prefix":"10.1016","volume":"24","author":[{"given":"Ami","family":"Arbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00055-X_BIB1","series-title":"Multiple Criteria Optimization: Theory, Computation, and Application","author":"Steuer","year":"1986"},{"key":"10.1016\/S0305-0548(96)00055-X_BIB2","series-title":"Multiple Criteria Decision Making","author":"Zeleny","year":"1982"},{"key":"10.1016\/S0305-0548(96)00055-X_BIB3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0305-0548(96)00055-X_BIB4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/j.1538-7305.1989.tb00315.x","article-title":"The AT & T KORBX\u00ae system","volume":"68","author":"Cheng","year":"1989","journal-title":"AT & T Tech. J."},{"key":"10.1016\/S0305-0548(96)00055-X_BIB5","series-title":"Progress in Mathematical Programming, Interior-Point and Related Method","first-page":"29","article-title":"A primal-dual interior point algorithm for linear programming","author":"Kojima","year":"1989"},{"issue":"4","key":"10.1016\/S0305-0548(96)00055-X_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.1.4.287","article-title":"Implementation of a dual affine interior point algorithm for linear programming","volume":"1","author":"Marsten","year":"1989","journal-title":"ORSA J. Comp."},{"issue":"2","key":"10.1016\/S0305-0548(96)00055-X_BIB7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","article-title":"An implementation of a primal-dual interior point method for linear programming","volume":"1","author":"McShane","year":"1989","journal-title":"ORSA J. Comp."},{"key":"10.1016\/S0305-0548(96)00055-X_BIB8","series-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"Megiddo","year":"1989"},{"issue":"6","key":"10.1016\/S0305-0548(96)00055-X_BIB9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(87)90040-X","article-title":"Computational experience with a dual variant of Karmarkar's method for linear programming","volume":"6","author":"Monma","year":"1987","journal-title":"Opns Res. Letts"},{"key":"10.1016\/S0305-0548(96)00055-X_BIB10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","article-title":"A modification of Karmarkar's linear programming algorithm","volume":"1","author":"Vanderbei","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S0305-0548(96)00055-X_BIB11","article-title":"Interior point methods for mathematical programming: a bibliography","author":"Kranich","year":"1991"},{"key":"10.1016\/S0305-0548(96)00055-X_BIB12","doi-asserted-by":"crossref","DOI":"10.21236\/ADA198944","article-title":"Interior-point methods for linear programming: A challenge to the simplex method","author":"Gill","year":"1988"},{"issue":"7","key":"10.1016\/S0305-0548(96)00055-X_BIB13","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/0305-0548(93)90059-R","article-title":"An interior multiobjective linear programming algorithm","volume":"20","author":"Arbel","year":"1993","journal-title":"Comp. Opns Res."},{"key":"10.1016\/S0305-0548(96)00055-X_BIB14","series-title":"Multicriteria Decision Making: The Analytic Hierarchy Process","author":"Saaty","year":"1988"},{"key":"10.1016\/S0305-0548(96)00055-X_BIB15","series-title":"Exploring Interior-Point Linear Programming: Algorithms and Software","author":"Arbel","year":"1993"},{"issue":"1","key":"10.1016\/S0305-0548(96)00055-X_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1057\/jors.1994.9","article-title":"Anchoring points and cones of opportunities in interior multiobjective linear programming problems","volume":"45","author":"Arbel","year":"1994","journal-title":"J. Opl Res. Soc."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489600055X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489600055X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T07:22:52Z","timestamp":1556263372000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505489600055X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S030505489600055X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00055-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}