Karmarkar's projective method for linear programming: A computational appraisal
Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a surve...
Gespeichert in:
| Veröffentlicht in: | Computers & industrial engineering 1989, Vol.16 (1), p.189-206 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 206 |
|---|---|
| container_issue | 1 |
| container_start_page | 189 |
| container_title | Computers & industrial engineering |
| container_volume | 16 |
| creator | Dodani, Mahesh H. Babu, A.J.G. |
| description | Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a survey of interior methods, with special emphasis on the projective method from a computational viewpoint. |
| doi_str_mv | 10.1016/0360-8352(89)90021-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_213752939</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0360835289900211</els_id><sourcerecordid>1017750</sourcerecordid><originalsourceid>FETCH-LOGICAL-c275t-d0cd88f1a5d1775971d9b02b929891c00656d738247e4d4a8814e34a9d05f1a23</originalsourceid><addsrcrecordid>eNp9kMtKxDAUhoMoOI6-gYsigrqonqRNk7gQhsEbDsxG1-FMkmrG3kw6gm9v64hLV2dxvv9cPkKOKVxSoMUVZAWkMuPsXKoLBcBoSnfIhEqhUuAcdsnkD9knBzGuASDnik7I8glDjeEdw1lMutCunen9p0tq17-1NinbkFS-cRjG5mvAuvbN63UyS0xbd5see982WCXYdQF9xOqQ7JVYRXf0W6fk5e72ef6QLpb3j_PZIjVM8D61YKyUJUVuqRBcCWrVCthKMSUVNQAFL6zIJMuFy22OUtLcZTkqC3xIsWxKTrZzh7M-Ni72et1uwnBK1IxmgjOVqQHKt5AJbYzBlboLfvj2S1PQozk9atGjFi2V_jGn6RA7_Z2N0WBVBmyMj39ZAYUsshG72WJu-PPTu6Cj8a4xzvowWNS29f_v-Qbr0oC-</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>213752939</pqid></control><display><type>article</type><title>Karmarkar's projective method for linear programming: A computational appraisal</title><source>Elsevier ScienceDirect Journals</source><creator>Dodani, Mahesh H. ; Babu, A.J.G.</creator><creatorcontrib>Dodani, Mahesh H. ; Babu, A.J.G.</creatorcontrib><description>Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a survey of interior methods, with special emphasis on the projective method from a computational viewpoint.</description><identifier>ISSN: 0360-8352</identifier><identifier>EISSN: 1879-0550</identifier><identifier>DOI: 10.1016/0360-8352(89)90021-1</identifier><identifier>CODEN: CINDDL</identifier><language>eng</language><publisher>Seoul: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Computer based modeling ; Exact sciences and technology ; Linear programming ; Mathematical analysis ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Simplex method</subject><ispartof>Computers & industrial engineering, 1989, Vol.16 (1), p.189-206</ispartof><rights>1989</rights><rights>1989 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. 1989</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c275t-d0cd88f1a5d1775971d9b02b929891c00656d738247e4d4a8814e34a9d05f1a23</citedby><cites>FETCH-LOGICAL-c275t-d0cd88f1a5d1775971d9b02b929891c00656d738247e4d4a8814e34a9d05f1a23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/0360835289900211$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,4009,27902,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7068631$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Dodani, Mahesh H.</creatorcontrib><creatorcontrib>Babu, A.J.G.</creatorcontrib><title>Karmarkar's projective method for linear programming: A computational appraisal</title><title>Computers & industrial engineering</title><description>Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a survey of interior methods, with special emphasis on the projective method from a computational viewpoint.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer based modeling</subject><subject>Exact sciences and technology</subject><subject>Linear programming</subject><subject>Mathematical analysis</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Simplex method</subject><issn>0360-8352</issn><issn>1879-0550</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNp9kMtKxDAUhoMoOI6-gYsigrqonqRNk7gQhsEbDsxG1-FMkmrG3kw6gm9v64hLV2dxvv9cPkKOKVxSoMUVZAWkMuPsXKoLBcBoSnfIhEqhUuAcdsnkD9knBzGuASDnik7I8glDjeEdw1lMutCunen9p0tq17-1NinbkFS-cRjG5mvAuvbN63UyS0xbd5see982WCXYdQF9xOqQ7JVYRXf0W6fk5e72ef6QLpb3j_PZIjVM8D61YKyUJUVuqRBcCWrVCthKMSUVNQAFL6zIJMuFy22OUtLcZTkqC3xIsWxKTrZzh7M-Ni72et1uwnBK1IxmgjOVqQHKt5AJbYzBlboLfvj2S1PQozk9atGjFi2V_jGn6RA7_Z2N0WBVBmyMj39ZAYUsshG72WJu-PPTu6Cj8a4xzvowWNS29f_v-Qbr0oC-</recordid><startdate>1989</startdate><enddate>1989</enddate><creator>Dodani, Mahesh H.</creator><creator>Babu, A.J.G.</creator><general>Elsevier Ltd</general><general>Pergamon Press</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1989</creationdate><title>Karmarkar's projective method for linear programming: A computational appraisal</title><author>Dodani, Mahesh H. ; Babu, A.J.G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c275t-d0cd88f1a5d1775971d9b02b929891c00656d738247e4d4a8814e34a9d05f1a23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer based modeling</topic><topic>Exact sciences and technology</topic><topic>Linear programming</topic><topic>Mathematical analysis</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Simplex method</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dodani, Mahesh H.</creatorcontrib><creatorcontrib>Babu, A.J.G.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & industrial engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dodani, Mahesh H.</au><au>Babu, A.J.G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Karmarkar's projective method for linear programming: A computational appraisal</atitle><jtitle>Computers & industrial engineering</jtitle><date>1989</date><risdate>1989</risdate><volume>16</volume><issue>1</issue><spage>189</spage><epage>206</epage><pages>189-206</pages><issn>0360-8352</issn><eissn>1879-0550</eissn><coden>CINDDL</coden><abstract>Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a survey of interior methods, with special emphasis on the projective method from a computational viewpoint.</abstract><cop>Seoul</cop><cop>Oxford</cop><cop>New York, NY</cop><pub>Elsevier Ltd</pub><doi>10.1016/0360-8352(89)90021-1</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-8352 |
| ispartof | Computers & industrial engineering, 1989, Vol.16 (1), p.189-206 |
| issn | 0360-8352 1879-0550 |
| language | eng |
| recordid | cdi_proquest_journals_213752939 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Computer based modeling Exact sciences and technology Linear programming Mathematical analysis Mathematical programming Operational research and scientific management Operational research. Management science Operations research Simplex method |
| title | Karmarkar's projective method for linear programming: A computational appraisal |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T19%3A41%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Karmarkar's%20projective%20method%20for%20linear%20programming:%20A%20computational%20appraisal&rft.jtitle=Computers%20&%20industrial%20engineering&rft.au=Dodani,%20Mahesh%20H.&rft.date=1989&rft.volume=16&rft.issue=1&rft.spage=189&rft.epage=206&rft.pages=189-206&rft.issn=0360-8352&rft.eissn=1879-0550&rft.coden=CINDDL&rft_id=info:doi/10.1016/0360-8352(89)90021-1&rft_dat=%3Cproquest_cross%3E1017750%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=213752939&rft_id=info:pmid/&rft_els_id=0360835289900211&rfr_iscdi=true |