Computational techniques of the simplex method:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
Kluwer
2003
|
| Schriftenreihe: | International series in operations research & management science
61 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XX, 325 S. graph. Darst. |
| ISBN: | 1402073321 9781402073328 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV021765503 | ||
| 003 | DE-604 | ||
| 005 | 20120109 | ||
| 007 | t | ||
| 008 | 061012s2003 xxud||| |||| 00||| eng d | ||
| 010 | |a 2002040603 | ||
| 020 | |a 1402073321 |9 1-402-07332-1 | ||
| 020 | |a 9781402073328 |9 978-1-402-07332-8 | ||
| 035 | |a (OCoLC)50773376 | ||
| 035 | |a (DE-599)BVBBV021765503 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-11 | ||
| 050 | 0 | |a T57.76 | |
| 082 | 0 | |a 519.7/2 |2 21 | |
| 084 | |a SK 300 |0 (DE-625)143230: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Maros, István |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computational techniques of the simplex method |c István Maros |
| 264 | 1 | |a Boston [u.a.] |b Kluwer |c 2003 | |
| 300 | |a XX, 325 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a International series in operations research & management science |v 61 | |
| 650 | 7 | |a Algoritmos e estruturas de dados |2 larpcal | |
| 650 | 7 | |a Programação linear |2 larpcal | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Linear programming | |
| 650 | 0 | 7 | |a Simplexverfahren |0 (DE-588)4181488-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Simplexverfahren |0 (DE-588)4181488-5 |D s |
| 689 | 0 | 1 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a International series in operations research & management science |v 61 |w (DE-604)BV011630976 |9 61 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014978503&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-014978503 | ||
Datensatz im Suchindex
| _version_ | 1804135630153711616 |
|---|---|
| adam_text | Contents
Preface xvii
Part I Preliminaries
1. THE LINEAR PROGRAMMING PROBLEM 3
1.1 Standard form 3
1.2 General form 4
1.2.1 Computational form #1 5
1.2.2 Computational form #2 13
1.3 Concluding remarks 17
1.3.1 Translation of bounds 17
1.3.2 Yet another formulation 17
2. THE SIMPLEX METHOD 19
2.1 Theoretical background 20
2.1.1 Basis and solution 21
2.1.2 The geometry of constraints 23
2.1.3 Neighboring bases 26
2.2 The primal simplex method 28
2.2.1 Optimality conditions 28
2.2.2 Improving a nonoptimal basic feasible solution 29
2.2.3 Algorithmic description of the simplex method 33
2.2.4 Finding a basic feasible solution 34
2.2.5 The two phase simplex method 37
2.3 Duality 38
2.4 The dual simplex method 40
2.4.1 Dual feasibility 40
viii COMPUTATIONAL SIMPLEX
2.4.2 Improving a dual feasible solution 41
2.4.3 Algorithmic steps of the dual 43
2.4.4 Further properties of the primal dual relationship 46
2.5 Concluding remarks 47
3. LARGE SCALE LP PROBLEMS 49
3.1 Sparsity 49
3.2 Instances of large problems 51
3.3 Structure 52
3.4 Fill in 53
3.5 Numerical difficulties 55
Part II Computational Techniques
4. DESIGN PRINCIPLES OF LP SYSTEMS 59
4.1 Requirements of LP software 60
4.2 Computer hardware 62
4.3 The software side of implementing LP solvers 65
5. DATA STRUCTURES AND BASIC OPERATIONS 69
5.1 Storing sparse vectors 70
5.2 Operations involving sparse vectors 71
5.2.1 Addition and accumulation of sparse vectors 71
5.2.2 Dot product of sparse vectors 74
5.3 Storing sparse matrices 74
5.4 Linked lists 76
5.5 Implementation of forward/backward linking 80
5.6 Concluding remarks 84
6. PROBLEM DEFINITION 87
6.1 The MPS format 87
6.2 Processing the MPS format 93
7. LP PREPROCESSING 97
7.1 Presolve 97
7.1.1 Contradicting individual bounds 100
7.1.2 Empty rows 100
7.1.3 Empty columns 100
7.1.4 Singleton rows 100
i
Contents ix
7.1.5 Removing fixed variables 101
7.1.6 Redundant and forcing constraints 102
7.1.7 Tightening individual bounds 102
7.1.8 Implied free variables 104
7.1.9 Singleton columns 105
7.1.10 Dominated variables 105
7.1.11 Reducing the sparsity of A 107
7.1.12 The algorithm 108
7.1.13 Implementation 109
7.2 Scaling 110
7.3 Postsolve 116
7.3.1 Unsealing 117
7.3.2 Undo presolve 118
7.3.3 Undo reformulation 119
8. BASIS INVERSE, FACTORIZATION 121
8.1 Product form of the inverse 122
8.1.1 General form 123
8.1.2 Sparsity exploiting form 124
8.1.3 Implementing the PFI 129
8.1.4 Operations with the PFI 131
8.2 LU factorization 134
8.2.1 Determining a sparse LU form 136
8.2.2 Implementing the LU factorization 143
8.2.3 Maintaining triangularity during iterations 149
8.2.4 Operations with the LU form 155
8.3 Concluding remarks 158
9. THE PRIMAL ALGORITHM 161
9.1 Solution, feasibility, infeasibility 162
9.2 Optimality conditions 164
9.3 Improving a BFS 167
9.3.1 The logic of the ratio test 173
9.3.2 Extensions to the ratio test 175
9.3.3 Algorithmic description of PSM G 176
9.3.4 Computational considerations 178
9.4 Determining the reduced costs 181
9.4.1 Computing dj 182
9.4.2 Updating * 182
x COMPUTATIONAL SIMPLEX
9.4.3 Updating dj 183
9.5 Selecting an incoming (improving) variable 184
9.5.1 Dantzig pricing 187
9.5.2 Partial pricing 187
9.5.3 Sectional pricing 188
9.5.4 Normalized pricing 189
9.5.5 A general pricing framework 198
9.6 Improving an infeasible basic solution 203
9.6.1 Analysis of w{t) 208
9.6.2 The logic of the ratio test 217
9.6.3 Extensions to the ratio test 217
9.6.4 Computational considerations 224
9.6.5 Adaptive composite pricing in phase 1 227
9.7 Handling degeneracy 230
9.7.1 Anti degeneracy column selection 232
9.7.2 Wolfe s ad hoc method 234
9.7.3 Expanding tolerance 237
9.7.4 Perturbation, shifting 241
9.8 Starting bases 244
9.8.1 Logical basis 244
9.8.2 Crash bases 246
9.8.3 CPLEX basis 253
9.8.4 A tearing algorithm 255
9.8.5 Partial basis 259
10. THE DUAL ALGORITHM 261
10.1 Dual feasibility, infeasibility 261
10.2 Improving a dual feasible solution 262
10.2.1 Dual algorithm with type 1 and type 2 variables 263
10.2.2 Dual algorithm with all types of variables 266
10.2.3 Bound flip in dual 267
10.2.4 Extended General Dual algorithm 270
10.3 Improving a dual infeasible solution 277
10.3.1 Analysis of the dual infeasibility function 281
10.3.2 Dual phase 1 iteration with all types of variables 284
10.4 Row selection (dual pricing) 292
10.4.1 Dantzig pricing 293
10.4.2 Steepest edge 293
Contents xi
10.4.3 Devex 296
10.4.4 Pricing in dual phase 1 297
10.5 Computing the pivot row 297
10.6 Degeneracy in the dual 298
11. VARIOUS ISSUES 301
11.1 Run parameters 301
11.1.1 Parameter file 302
11.1.2 String parameters 302
11.1.3 Algorithmic parameters 303
11.1.4 Numerical parameters 303
11.2 Performance evaluation, profiling 303
11.3 Some alternative techniques 306
11.3.1 Superbasic variables 306
11.3.2 Row basis 307
11.4 Modeling systems 310
11.5 A prototype simplex solver 311
Index
321
|
| adam_txt |
Contents
Preface xvii
Part I Preliminaries
1. THE LINEAR PROGRAMMING PROBLEM 3
1.1 Standard form 3
1.2 General form 4
1.2.1 Computational form #1 5
1.2.2 Computational form #2 13
1.3 Concluding remarks 17
1.3.1 Translation of bounds 17
1.3.2 Yet another formulation 17
2. THE SIMPLEX METHOD 19
2.1 Theoretical background 20
2.1.1 Basis and solution 21
2.1.2 The geometry of constraints 23
2.1.3 Neighboring bases 26
2.2 The primal simplex method 28
2.2.1 Optimality conditions 28
2.2.2 Improving a nonoptimal basic feasible solution 29
2.2.3 Algorithmic description of the simplex method 33
2.2.4 Finding a basic feasible solution 34
2.2.5 The two phase simplex method 37
2.3 Duality 38
2.4 The dual simplex method 40
2.4.1 Dual feasibility 40
viii COMPUTATIONAL SIMPLEX
2.4.2 Improving a dual feasible solution 41
2.4.3 Algorithmic steps of the dual 43
2.4.4 Further properties of the primal dual relationship 46
2.5 Concluding remarks 47
3. LARGE SCALE LP PROBLEMS 49
3.1 Sparsity 49
3.2 Instances of large problems 51
3.3 Structure 52
3.4 Fill in 53
3.5 Numerical difficulties 55
Part II Computational Techniques
4. DESIGN PRINCIPLES OF LP SYSTEMS 59
4.1 Requirements of LP software 60
4.2 Computer hardware 62
4.3 The software side of implementing LP solvers 65
5. DATA STRUCTURES AND BASIC OPERATIONS 69
5.1 Storing sparse vectors 70
5.2 Operations involving sparse vectors 71
5.2.1 Addition and accumulation of sparse vectors 71
5.2.2 Dot product of sparse vectors 74
5.3 Storing sparse matrices 74
5.4 Linked lists 76
5.5 Implementation of forward/backward linking 80
5.6 Concluding remarks 84
6. PROBLEM DEFINITION 87
6.1 The MPS format 87
6.2 Processing the MPS format 93
7. LP PREPROCESSING 97
7.1 Presolve 97
7.1.1 Contradicting individual bounds 100
7.1.2 Empty rows 100
7.1.3 Empty columns 100
7.1.4 Singleton rows 100
i
Contents ix
7.1.5 Removing fixed variables 101
7.1.6 Redundant and forcing constraints 102
7.1.7 Tightening individual bounds 102
7.1.8 Implied free variables 104
7.1.9 Singleton columns 105
7.1.10 Dominated variables 105
7.1.11 Reducing the sparsity of A 107
7.1.12 The algorithm 108
7.1.13 Implementation 109
7.2 Scaling 110
7.3 Postsolve 116
7.3.1 Unsealing 117
7.3.2 Undo presolve 118
7.3.3 Undo reformulation 119
8. BASIS INVERSE, FACTORIZATION 121
8.1 Product form of the inverse 122
8.1.1 General form 123
8.1.2 Sparsity exploiting form 124
8.1.3 Implementing the PFI 129
8.1.4 Operations with the PFI 131
8.2 LU factorization 134
8.2.1 Determining a sparse LU form 136
8.2.2 Implementing the LU factorization 143
8.2.3 Maintaining triangularity during iterations 149
8.2.4 Operations with the LU form 155
8.3 Concluding remarks 158
9. THE PRIMAL ALGORITHM 161
9.1 Solution, feasibility, infeasibility 162
9.2 Optimality conditions 164
9.3 Improving a BFS 167
9.3.1 The logic of the ratio test 173
9.3.2 Extensions to the ratio test 175
9.3.3 Algorithmic description of PSM G 176
9.3.4 Computational considerations 178
9.4 Determining the reduced costs 181
9.4.1 Computing dj 182
9.4.2 Updating * 182
x COMPUTATIONAL SIMPLEX
9.4.3 Updating dj 183
9.5 Selecting an incoming (improving) variable 184
9.5.1 Dantzig pricing 187
9.5.2 Partial pricing 187
9.5.3 Sectional pricing 188
9.5.4 Normalized pricing 189
9.5.5 A general pricing framework 198
9.6 Improving an infeasible basic solution 203
9.6.1 Analysis of w{t) 208
9.6.2 The logic of the ratio test 217
9.6.3 Extensions to the ratio test 217
9.6.4 Computational considerations 224
9.6.5 Adaptive composite pricing in phase 1 227
9.7 Handling degeneracy 230
9.7.1 Anti degeneracy column selection 232
9.7.2 Wolfe's 'ad hoc' method 234
9.7.3 Expanding tolerance 237
9.7.4 Perturbation, shifting 241
9.8 Starting bases 244
9.8.1 Logical basis 244
9.8.2 Crash bases 246
9.8.3 CPLEX basis 253
9.8.4 A tearing algorithm 255
9.8.5 Partial basis 259
10. THE DUAL ALGORITHM 261
10.1 Dual feasibility, infeasibility 261
10.2 Improving a dual feasible solution 262
10.2.1 Dual algorithm with type 1 and type 2 variables 263
10.2.2 Dual algorithm with all types of variables 266
10.2.3 Bound flip in dual 267
10.2.4 Extended General Dual algorithm 270
10.3 Improving a dual infeasible solution 277
10.3.1 Analysis of the dual infeasibility function 281
10.3.2 Dual phase 1 iteration with all types of variables 284
10.4 Row selection (dual pricing) 292
10.4.1 Dantzig pricing 293
10.4.2 Steepest edge 293
Contents xi
10.4.3 Devex 296
10.4.4 Pricing in dual phase 1 297
10.5 Computing the pivot row 297
10.6 Degeneracy in the dual 298
11. VARIOUS ISSUES 301
11.1 Run parameters 301
11.1.1 Parameter file 302
11.1.2 String parameters 302
11.1.3 Algorithmic parameters 303
11.1.4 Numerical parameters 303
11.2 Performance evaluation, profiling 303
11.3 Some alternative techniques 306
11.3.1 Superbasic variables 306
11.3.2 Row basis 307
11.4 Modeling systems 310
11.5 A prototype simplex solver 311
Index
321 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Maros, István |
| author_facet | Maros, István |
| author_role | aut |
| author_sort | Maros, István |
| author_variant | i m im |
| building | Verbundindex |
| bvnumber | BV021765503 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.76 |
| callnumber-search | T57.76 |
| callnumber-sort | T 257.76 |
| callnumber-subject | T - General Technology |
| classification_rvk | SK 300 ST 134 |
| ctrlnum | (OCoLC)50773376 (DE-599)BVBBV021765503 |
| dewey-full | 519.7/2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7/2 |
| dewey-search | 519.7/2 |
| dewey-sort | 3519.7 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01858nam a2200481 cb4500</leader><controlfield tag="001">BV021765503</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120109 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">061012s2003 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2002040603</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1402073321</subfield><subfield code="9">1-402-07332-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781402073328</subfield><subfield code="9">978-1-402-07332-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)50773376</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021765503</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7/2</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 300</subfield><subfield code="0">(DE-625)143230:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Maros, István</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational techniques of the simplex method</subfield><subfield code="c">István Maros</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 325 S.</subfield><subfield code="b">graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">International series in operations research & management science</subfield><subfield code="v">61</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos e estruturas de dados</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programação linear</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Simplexverfahren</subfield><subfield code="0">(DE-588)4181488-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Simplexverfahren</subfield><subfield code="0">(DE-588)4181488-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">International series in operations research & management science</subfield><subfield code="v">61</subfield><subfield code="w">(DE-604)BV011630976</subfield><subfield code="9">61</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014978503&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014978503</subfield></datafield></record></collection> |
| id | DE-604.BV021765503 |
| illustrated | Illustrated |
| index_date | 2024-07-02T15:36:35Z |
| indexdate | 2024-07-09T20:43:33Z |
| institution | BVB |
| isbn | 1402073321 9781402073328 |
| language | English |
| lccn | 2002040603 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014978503 |
| oclc_num | 50773376 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | XX, 325 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Kluwer |
| record_format | marc |
| series | International series in operations research & management science |
| series2 | International series in operations research & management science |
| spelling | Maros, István Verfasser aut Computational techniques of the simplex method István Maros Boston [u.a.] Kluwer 2003 XX, 325 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier International series in operations research & management science 61 Algoritmos e estruturas de dados larpcal Programação linear larpcal Computer algorithms Linear programming Simplexverfahren (DE-588)4181488-5 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Simplexverfahren (DE-588)4181488-5 s Algorithmische Programmierung (DE-588)4293504-0 s DE-604 International series in operations research & management science 61 (DE-604)BV011630976 61 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014978503&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Maros, István Computational techniques of the simplex method International series in operations research & management science Algoritmos e estruturas de dados larpcal Programação linear larpcal Computer algorithms Linear programming Simplexverfahren (DE-588)4181488-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd |
| subject_GND | (DE-588)4181488-5 (DE-588)4293504-0 |
| title | Computational techniques of the simplex method |
| title_auth | Computational techniques of the simplex method |
| title_exact_search | Computational techniques of the simplex method |
| title_exact_search_txtP | Computational techniques of the simplex method |
| title_full | Computational techniques of the simplex method István Maros |
| title_fullStr | Computational techniques of the simplex method István Maros |
| title_full_unstemmed | Computational techniques of the simplex method István Maros |
| title_short | Computational techniques of the simplex method |
| title_sort | computational techniques of the simplex method |
| topic | Algoritmos e estruturas de dados larpcal Programação linear larpcal Computer algorithms Linear programming Simplexverfahren (DE-588)4181488-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd |
| topic_facet | Algoritmos e estruturas de dados Programação linear Computer algorithms Linear programming Simplexverfahren Algorithmische Programmierung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014978503&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV011630976 |
| work_keys_str_mv | AT marosistvan computationaltechniquesofthesimplexmethod |