{"id":"https://openalex.org/W2171586366","doi":"https://doi.org/10.1137/s1052623493254273","title":"Solving LP Problems via Weighted Centers","display_name":"Solving LP Problems via Weighted Centers","publication_year":1996,"publication_date":"1996-11-01","ids":{"openalex":"https://openalex.org/W2171586366","doi":"https://doi.org/10.1137/s1052623493254273","mag":"2171586366"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623493254273","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493254273","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012410257","display_name":"Aiping Liao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aiping Liao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102817920","display_name":"Michael J. Todd","orcid":"https://orcid.org/0000-0001-9458-3443"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael J. Todd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.27401647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"4","first_page":"933","last_page":"960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.9031367301940918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.74690181016922},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.7319737672805786},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6727979183197021},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6592596769332886},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5870782732963562},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5798609256744385},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5676230192184448},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5347681641578674},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4994323253631592},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4836357831954956},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4512934386730194},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4289973974227905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3717217743396759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23790019750595093},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.12671828269958496}],"concepts":[{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.9031367301940918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.74690181016922},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.7319737672805786},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6727979183197021},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6592596769332886},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5870782732963562},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5798609256744385},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5676230192184448},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5347681641578674},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4994323253631592},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4836357831954956},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4512934386730194},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4289973974227905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3717217743396759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23790019750595093},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.12671828269958496},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s1052623493254273","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493254273","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.5472","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.orie.cornell.edu/pub/techreps/TR1064.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.5620","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.5620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.tc.cornell.edu/pub/tech.reports/tr145.ps","raw_type":"text"},{"id":"pmh:oai:ecommons.cornell.edu:1813/5464","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/5464","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"},{"id":"pmh:oai:ecommons.cornell.edu:1813/5501","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/5501","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"},{"id":"pmh:oai:ecommons.cornell.edu:1813/8948","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/8948","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W21055737","https://openalex.org/W187211397","https://openalex.org/W569537782","https://openalex.org/W1499520404","https://openalex.org/W1539402525","https://openalex.org/W1751167696","https://openalex.org/W1862519416","https://openalex.org/W1973117121","https://openalex.org/W1980869082","https://openalex.org/W2003889804","https://openalex.org/W2005569165","https://openalex.org/W2016904922","https://openalex.org/W2034124193","https://openalex.org/W2046499385","https://openalex.org/W2050434204","https://openalex.org/W2055356142","https://openalex.org/W2055582487","https://openalex.org/W2061711344","https://openalex.org/W2086580845","https://openalex.org/W2169170556","https://openalex.org/W2610857016","https://openalex.org/W2611147814","https://openalex.org/W4249667877","https://openalex.org/W4254960878"],"related_works":["https://openalex.org/W2235431948","https://openalex.org/W2031732959","https://openalex.org/W7739709","https://openalex.org/W2562629174","https://openalex.org/W1500330311","https://openalex.org/W2061711344","https://openalex.org/W2169170556","https://openalex.org/W2034124193","https://openalex.org/W2016090484","https://openalex.org/W2189529046"],"abstract_inverted_index":{"The":[0,66],"feasibility":[1],"problem":[2,16],"for":[3,34,103,114],"a":[4,29,76],"system":[5],"of":[6,46,68,100],"linear":[7,116],"inequalities":[8],"can":[9,25],"be":[10,26,75],"converted":[11],"into":[12],"an":[13,47],"unconstrained":[14],"optimization":[15],"by":[17,56],"using":[18],"ideas":[19],"from":[20],"the":[21,35,44,64,69,80,104],"ellipsoid":[22,48,71],"method,":[23],"which":[24,53,59,95],"viewed":[27],"as":[28],"very":[30],"simple":[31],"minimization":[32,86],"technique":[33],"resulting":[36,70],"nonlinear":[37,85],"function.":[38,65],"This":[39],"function":[40],"is":[41,54],"related":[42],"to":[43,62,74,79,97],"volume":[45],"containing":[49],"all":[50],"feasible":[51,77,105],"solutions,":[52],"parametrized":[55],"certain":[57],"weights":[58],"we":[60,88,110],"choose":[61],"minimize":[63],"center":[67],"turns":[72],"out":[73],"solution":[78],"inequalities.":[81],"Using":[82,107],"more":[83,92],"sophisticated":[84],"algorithms,":[87],"develop":[89,111],"and":[90],"investigate":[91],"efficient":[93],"methods,":[94],"lead":[96],"two":[98],"kinds":[99],"weighted":[101],"centers":[102],"set.":[106],"these":[108],"centers,":[109],"new":[112],"algorithms":[113],"solving":[115],"programming":[117],"problems.":[118]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}