Linear Programming:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Birkhäuser Boston
1991
|
| Ausgabe: | 1 |
| Schriftenreihe: | Modern Birkhäuser Classics
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews The reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming. —Mathematics of Computing This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice. After preliminary discussion of linear algebra and geometry, it describes the simplex algorithm, duality, the ellipsoid algorithm (Khachiyan’s algorithm) and Karmarkar’s algorithm. —Zentralblatt Math The exposition is clear and elementary; it also contains many exercises and illustrations. —Mathematical Reviews A self-contained, concise mathematical introduction to the theory of linear programming. —Journal of Economic Literature |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9780817648442 9780817648435 |
| DOI: | 10.1007/978-0-8176-4844-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042419168 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1991 |||| o||u| ||||||eng d | ||
| 020 | |a 9780817648442 |c Online |9 978-0-8176-4844-2 | ||
| 020 | |a 9780817648435 |c Print |9 978-0-8176-4843-5 | ||
| 024 | 7 | |a 10.1007/978-0-8176-4844-2 |2 doi | |
| 035 | |a (OCoLC)1165545851 | ||
| 035 | |a (DE-599)BVBBV042419168 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 005.11 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Karloff, Howard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear Programming |c by Howard Karloff |
| 250 | |a 1 | ||
| 264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 1991 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Modern Birkhäuser Classics | |
| 500 | |a To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews The reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming. —Mathematics of Computing This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice. After preliminary discussion of linear algebra and geometry, it describes the simplex algorithm, duality, the ellipsoid algorithm (Khachiyan’s algorithm) and Karmarkar’s algorithm. —Zentralblatt Math The exposition is clear and elementary; it also contains many exercises and illustrations. —Mathematical Reviews A self-contained, concise mathematical introduction to the theory of linear programming. —Journal of Economic Literature | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Programming Techniques | |
| 650 | 4 | |a Applications of Mathematics | |
| 650 | 4 | |a Programming Languages, Compilers, Interpreters | |
| 650 | 4 | |a Math Applications in Computer Science | |
| 650 | 4 | |a Computational Mathematics and Numerical Analysis | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Lineare Optimierung |0 (DE-588)4035816-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-0-8176-4844-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027854584 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153089485176832 |
|---|---|
| any_adam_object | |
| author | Karloff, Howard |
| author_facet | Karloff, Howard |
| author_role | aut |
| author_sort | Karloff, Howard |
| author_variant | h k hk |
| building | Verbundindex |
| bvnumber | BV042419168 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1165545851 (DE-599)BVBBV042419168 |
| dewey-full | 005.11 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.11 |
| dewey-search | 005.11 |
| dewey-sort | 15.11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-0-8176-4844-2 |
| edition | 1 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03493nmm a2200577zc 4500</leader><controlfield tag="001">BV042419168</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1991 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817648442</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-8176-4844-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817648435</subfield><subfield code="c">Print</subfield><subfield code="9">978-0-8176-4843-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-0-8176-4844-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1165545851</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419168</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.11</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karloff, Howard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear Programming</subfield><subfield code="c">by Howard Karloff</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Modern Birkhäuser Classics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews The reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming. —Mathematics of Computing This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice. After preliminary discussion of linear algebra and geometry, it describes the simplex algorithm, duality, the ellipsoid algorithm (Khachiyan’s algorithm) and Karmarkar’s algorithm. —Zentralblatt Math The exposition is clear and elementary; it also contains many exercises and illustrations. —Mathematical Reviews A self-contained, concise mathematical introduction to the theory of linear programming. —Journal of Economic Literature</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Applications of Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Languages, Compilers, Interpreters</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Math Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematics and Numerical Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-0-8176-4844-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854584</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042419168 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:04Z |
| institution | BVB |
| isbn | 9780817648442 9780817648435 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854584 |
| oclc_num | 1165545851 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Birkhäuser Boston |
| record_format | marc |
| series2 | Modern Birkhäuser Classics |
| spelling | Karloff, Howard Verfasser aut Linear Programming by Howard Karloff 1 Boston, MA Birkhäuser Boston 1991 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Modern Birkhäuser Classics To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews The reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming. —Mathematics of Computing This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice. After preliminary discussion of linear algebra and geometry, it describes the simplex algorithm, duality, the ellipsoid algorithm (Khachiyan’s algorithm) and Karmarkar’s algorithm. —Zentralblatt Math The exposition is clear and elementary; it also contains many exercises and illustrations. —Mathematical Reviews A self-contained, concise mathematical introduction to the theory of linear programming. —Journal of Economic Literature Computer science Computer software Mathematics Computer science / Mathematics Computer Science Programming Techniques Applications of Mathematics Programming Languages, Compilers, Interpreters Math Applications in Computer Science Computational Mathematics and Numerical Analysis Algorithm Analysis and Problem Complexity Informatik Mathematik Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 s 1\p DE-604 https://doi.org/10.1007/978-0-8176-4844-2 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Karloff, Howard Linear Programming Computer science Computer software Mathematics Computer science / Mathematics Computer Science Programming Techniques Applications of Mathematics Programming Languages, Compilers, Interpreters Math Applications in Computer Science Computational Mathematics and Numerical Analysis Algorithm Analysis and Problem Complexity Informatik Mathematik Lineare Optimierung (DE-588)4035816-1 gnd |
| subject_GND | (DE-588)4035816-1 |
| title | Linear Programming |
| title_auth | Linear Programming |
| title_exact_search | Linear Programming |
| title_full | Linear Programming by Howard Karloff |
| title_fullStr | Linear Programming by Howard Karloff |
| title_full_unstemmed | Linear Programming by Howard Karloff |
| title_short | Linear Programming |
| title_sort | linear programming |
| topic | Computer science Computer software Mathematics Computer science / Mathematics Computer Science Programming Techniques Applications of Mathematics Programming Languages, Compilers, Interpreters Math Applications in Computer Science Computational Mathematics and Numerical Analysis Algorithm Analysis and Problem Complexity Informatik Mathematik Lineare Optimierung (DE-588)4035816-1 gnd |
| topic_facet | Computer science Computer software Mathematics Computer science / Mathematics Computer Science Programming Techniques Applications of Mathematics Programming Languages, Compilers, Interpreters Math Applications in Computer Science Computational Mathematics and Numerical Analysis Algorithm Analysis and Problem Complexity Informatik Mathematik Lineare Optimierung |
| url | https://doi.org/10.1007/978-0-8176-4844-2 |
| work_keys_str_mv | AT karloffhoward linearprogramming |