{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:35:46Z","timestamp":1648902946676},"reference-count":37,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0096-3003(01)00289-2","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T13:33:13Z","timestamp":1034256793000},"page":"345-361","source":"Crossref","is-referenced-by-count":3,"title":["Linearly constrained global optimization: a general solution algorithm with applications"],"prefix":"10.1016","volume":"134","author":[{"given":"Hossein","family":"Arsham","sequence":"first","affiliation":[]},{"given":"Miro","family":"Gradisar","sequence":"additional","affiliation":[]},{"given":"Mojca","family":"Indihar Stemberger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-3003(01)00289-2_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02242366","article-title":"An algorithm for enumerating the vertices of a convex polyhedron","volume":"15","author":"Altherr","year":"1975","journal-title":"Computing"},{"issue":"89","key":"10.1016\/S0096-3003(01)00289-2_BIB2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0377-2217(96)90078-8","article-title":"Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm","volume":"1","author":"Arbel","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/02331939508844049","article-title":"A comprehensive simplex-like algorithm for network optimization and perturbation analysis","volume":"32","author":"Arsham","year":"1995","journal-title":"Optimization"},{"issue":"2","key":"10.1016\/S0096-3003(01)00289-2_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0898-1221(90)90344-J","article-title":"A complete algorithm for linear fractional programs","volume":"20","author":"Arsham","year":"1990","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1025601511684","article-title":"Affine geometric method for linear programs","volume":"12","author":"Arsham","year":"1997","journal-title":"J. Sci. Comput."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB6","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1137\/S0036144596304722","article-title":"Initialization of the simplex algorithm: An artificial-free approach","volume":"39","author":"Arsham","year":"1997","journal-title":"SIAM Rev."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB7","first-page":"251","article-title":"Computational geometry and linear programs","volume":"1","author":"Arsham","year":"1999","journal-title":"Int. J. Math. Algorithms"},{"issue":"1","key":"10.1016\/S0096-3003(01)00289-2_BIB8","first-page":"37","article-title":"Continuous global optimization over polyhedrons: A new introduction to optimization","volume":"1","author":"Arsham","year":"2002","journal-title":"Int. Math. J."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB9","series-title":"Polytopes \u2013 Combinatorics and Computation","article-title":"A revised implementation of the reverse search vertex enumeration algorithm","author":"Avis","year":"2000"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00940811","article-title":"The simplex method and unrestricted variables","volume":"45","author":"Best","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB12","doi-asserted-by":"crossref","unstructured":"D. Bremner, K. Fukuda, A. Marzetta, Primal-dual methods for vertex and facet enumeration, in: Proceedings of the 13th Annual ACM Symposium on Computers and Geometry, 1997, pp. 49\u201356","DOI":"10.1145\/262839.262861"},{"issue":"4","key":"10.1016\/S0096-3003(01)00289-2_BIB13","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF03398591","article-title":"A linear fractional program with homogeneous constraints","volume":"36","author":"Chandra","year":"1999","journal-title":"Opsearch"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB14","series-title":"Linear Programming","author":"Chvatal","year":"1983"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB15","unstructured":"L. Cooper, Applied Nonlinear Programming for Engineers and Scientists, Englewood, NJ, Aloray, 1974"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB16","series-title":"Introduction to Operations Research","author":"Cooper","year":"1977"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB17","series-title":"Introduction to Methods of Optimization","author":"Cooper","year":"1970"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB18","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1016\/S0305-0548(97)00026-9","article-title":"Formulation assistance for global optimization problems","volume":"24","author":"Dravnieks","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01593771","article-title":"An algorithm for determing all extreme points of a convex polytope","volume":"12","author":"Dyer","year":"1977","journal-title":"Math. Prog."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB20","series-title":"Nonlinear Programming Sequential Unconstrained Minimization Techniques Classics in Applied Mathematics","author":"Fiacco","year":"1990"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB21","series-title":"Practical Methods of Optimization","author":"Fletcher","year":"1987"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB22","series-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","author":"Floudas","year":"1990"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0925-7721(94)90017-5","article-title":"Combinatorial face enumeration in convex polytopes","volume":"4","author":"Fukuda","year":"1994","journal-title":"Comput. Geom."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(95)00049-6","article-title":"Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron","volume":"8","author":"Fukuda","year":"1997","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"3","key":"10.1016\/S0096-3003(01)00289-2_BIB25","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","article-title":"A practical anti-cycling procedure for linearly constrained optimization","volume":"45","author":"Gill","year":"1989","journal-title":"Math. Prog.: Ser. B"},{"issue":"1","key":"10.1016\/S0096-3003(01)00289-2_BIB26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(94)90147-3","article-title":"Simultaneous determination of capacities and load in parallel M\/M\/1 queues","volume":"73","author":"Heeseok","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB27","series-title":"Introduction To Operations Research","author":"Hillier","year":"1995"},{"issue":"3","key":"10.1016\/S0096-3003(01)00289-2_BIB28","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/S0377-2217(98)00052-6","article-title":"A mathematical programming approach to clusterwise regression model and its extensions","volume":"116","author":"Kin-nam","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB29","series-title":"Iterative Methods for Linear and Nonlinear Equations","author":"Kelley","year":"1995"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0096-3003(99)00037-5","article-title":"Constraint exploration method for quadratic programming problem","volume":"112","author":"Mohd","year":"2000","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB31","first-page":"51","article-title":"The double description method","volume":"8","author":"Motzkin","year":"1953","journal-title":"Ann. Math. Stud."},{"issue":"1","key":"10.1016\/S0096-3003(01)00289-2_BIB32","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0377-2217(94)90152-X","article-title":"Some results concerning post-infeasibility analysis","volume":"73","author":"Nilotpal","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB33","unstructured":"J. Pint\u00e9r, Continuous global optimization: An introduction to models, solution approaches, tests and applications, ITORMS 2, 1999"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB34","series-title":"Model Building in Mathematical Programming","author":"Williams","year":"1999"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB35","series-title":"Introduction to Mathematical Programming: Applications and Algorithms","author":"Winston","year":"1997"},{"key":"10.1016\/S0096-3003(01)00289-2_BIB36","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0305-0548(94)90027-2","article-title":"Enumerating extreme points of a highly degenerate polytope","volume":"21","author":"Yamada","year":"1994","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0096-3003(01)00289-2_BIB37","series-title":"Lectures on Polytopes","author":"Ziegler","year":"1995"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300301002892?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300301002892?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T22:39:45Z","timestamp":1578782385000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300301002892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":37,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0096300301002892"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(01)00289-2","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}