Linear Programming: Algorithms and applications
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Dordrecht
Springer Netherlands
1981
|
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of management, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in some combinatorial theory as well. The chapters on duality, and on flow in networks, are particularly directed towards this aim and they contain theorems which might not be directly relevant to methods of computation. The application of the concept of duality to the theory of games is of historical interest. It is hoped that the figures, which illustrate the results, will be found illuminating by readers with active geometrical imagination |
| Physical Description: | 1 Online-Ressource (VIII, 150 p) |
| ISBN: | 9789401169240 9780412164309 |
| DOI: | 10.1007/978-94-011-6924-0 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042424002 | ||
| 003 | DE-604 | ||
| 005 | 20171011 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1981 |||| o||u| ||||||eng d | ||
| 020 | |a 9789401169240 |c Online |9 978-94-011-6924-0 | ||
| 020 | |a 9780412164309 |c Print |9 978-0-412-16430-9 | ||
| 024 | 7 | |a 10.1007/978-94-011-6924-0 |2 doi | |
| 035 | |a (OCoLC)1185197418 | ||
| 035 | |a (DE-599)BVBBV042424002 | ||
| 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 519.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Vajda, S. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear Programming |b Algorithms and applications |c by S. Vajda |
| 264 | 1 | |a Dordrecht |b Springer Netherlands |c 1981 | |
| 300 | |a 1 Online-Ressource (VIII, 150 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of management, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in some combinatorial theory as well. The chapters on duality, and on flow in networks, are particularly directed towards this aim and they contain theorems which might not be directly relevant to methods of computation. The application of the concept of duality to the theory of games is of historical interest. It is hoped that the figures, which illustrate the results, will be found illuminating by readers with active geometrical imagination | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Science (General) | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Operations Research, Management Science | |
| 650 | 4 | |a Operation Research/Decision Theory | |
| 650 | 4 | |a Data Structures | |
| 650 | 4 | |a Science, general | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Naturwissenschaft | |
| 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-94-011-6924-0 |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-027859419 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804153100418678784 |
|---|---|
| any_adam_object | |
| author | Vajda, S. |
| author_facet | Vajda, S. |
| author_role | aut |
| author_sort | Vajda, S. |
| author_variant | s v sv |
| building | Verbundindex |
| bvnumber | BV042424002 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1185197418 (DE-599)BVBBV042424002 |
| dewey-full | 519.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6 |
| dewey-search | 519.6 |
| dewey-sort | 3519.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-94-011-6924-0 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03186nmm a2200517zc 4500</leader><controlfield tag="001">BV042424002</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171011 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1981 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789401169240</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-011-6924-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780412164309</subfield><subfield code="c">Print</subfield><subfield code="9">978-0-412-16430-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-94-011-6924-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1185197418</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042424002</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">519.6</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">Vajda, S.</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="b">Algorithms and applications</subfield><subfield code="c">by S. Vajda</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 150 p)</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="500" ind1=" " ind2=" "><subfield code="a">This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of management, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in some combinatorial theory as well. The chapters on duality, and on flow in networks, are particularly directed towards this aim and they contain theorems which might not be directly relevant to methods of computation. The application of the concept of duality to the theory of games is of historical interest. It is hoped that the figures, which illustrate the results, will be found illuminating by readers with active geometrical imagination</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Science (General)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research, Management Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Science, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Naturwissenschaft</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-94-011-6924-0</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-027859419</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.BV042424002 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:14Z |
| institution | BVB |
| isbn | 9789401169240 9780412164309 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027859419 |
| oclc_num | 1185197418 |
| 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 (VIII, 150 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| publisher | Springer Netherlands |
| record_format | marc |
| spelling | Vajda, S. Verfasser aut Linear Programming Algorithms and applications by S. Vajda Dordrecht Springer Netherlands 1981 1 Online-Ressource (VIII, 150 p) txt rdacontent c rdamedia cr rdacarrier This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of management, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in some combinatorial theory as well. The chapters on duality, and on flow in networks, are particularly directed towards this aim and they contain theorems which might not be directly relevant to methods of computation. The application of the concept of duality to the theory of games is of historical interest. It is hoped that the figures, which illustrate the results, will be found illuminating by readers with active geometrical imagination Mathematics Science (General) Data structures (Computer science) Operations research Operations Research, Management Science Operation Research/Decision Theory Data Structures Science, general Mathematik Naturwissenschaft 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-94-011-6924-0 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Vajda, S. Linear Programming Algorithms and applications Mathematics Science (General) Data structures (Computer science) Operations research Operations Research, Management Science Operation Research/Decision Theory Data Structures Science, general Mathematik Naturwissenschaft Lineare Optimierung (DE-588)4035816-1 gnd |
| subject_GND | (DE-588)4035816-1 |
| title | Linear Programming Algorithms and applications |
| title_auth | Linear Programming Algorithms and applications |
| title_exact_search | Linear Programming Algorithms and applications |
| title_full | Linear Programming Algorithms and applications by S. Vajda |
| title_fullStr | Linear Programming Algorithms and applications by S. Vajda |
| title_full_unstemmed | Linear Programming Algorithms and applications by S. Vajda |
| title_short | Linear Programming |
| title_sort | linear programming algorithms and applications |
| title_sub | Algorithms and applications |
| topic | Mathematics Science (General) Data structures (Computer science) Operations research Operations Research, Management Science Operation Research/Decision Theory Data Structures Science, general Mathematik Naturwissenschaft Lineare Optimierung (DE-588)4035816-1 gnd |
| topic_facet | Mathematics Science (General) Data structures (Computer science) Operations research Operations Research, Management Science Operation Research/Decision Theory Data Structures Science, general Mathematik Naturwissenschaft Lineare Optimierung |
| url | https://doi.org/10.1007/978-94-011-6924-0 |
| work_keys_str_mv | AT vajdas linearprogrammingalgorithmsandapplications |