Linear and nonlinear programming:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cham [u.a.]
Springer
2016
|
Ausgabe: | 4. ed. |
Schriftenreihe: | International series in operations research & management science
228 |
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | XIII, 546 S. graph. Darst. 235 mm x 155 mm, 0 g |
ISBN: | 3319188410 9783319188416 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV042937459 | ||
003 | DE-604 | ||
005 | 20170807 | ||
007 | t | ||
008 | 151020s2016 d||| |||| 00||| eng d | ||
016 | 7 | |a 1069433403 |2 DE-101 | |
020 | |a 3319188410 |9 3-319-18841-0 | ||
020 | |a 9783319188416 |c Gb. : ca. EUR 96.29 (DE) (freier Pr.), ca. EUR 98.99 (AT) (freier Pr.), ca. sfr 99.50 (freier Pr.) |9 978-3-319-18841-6 | ||
024 | 3 | |a 9783319188416 | |
028 | 5 | 2 | |a Best.-Nr.: 978-3-319-18841-6 |
035 | |a (OCoLC)927102532 | ||
035 | |a (DE-599)DNB1069433403 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-11 |a DE-92 |a DE-384 |a DE-634 |a DE-19 |a DE-20 |a DE-83 | ||
082 | 0 | |a 519.72 |2 23 | |
084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
084 | |a 330 |2 sdnb | ||
100 | 1 | |a Luenberger, David G. |d 1937- |e Verfasser |0 (DE-588)135911338 |4 aut | |
245 | 1 | 0 | |a Linear and nonlinear programming |c David G. Luenberger ; Yinyu Ye |
250 | |a 4. ed. | ||
264 | 1 | |a Cham [u.a.] |b Springer |c 2016 | |
300 | |a XIII, 546 S. |b graph. Darst. |c 235 mm x 155 mm, 0 g | ||
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 228 | |
650 | 0 | 7 | |a Lineare Optimierung |0 (DE-588)4035816-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Lineare Ordnung |0 (DE-588)4167706-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
653 | |a Research ; Zielgruppe | ||
653 | |a TBC ; BIC Subject Heading | ||
653 | |a Semidefinite Programming | ||
653 | |a Linear Programming | ||
653 | |a Nonlinear Programming | ||
653 | |a Mathematical Programming | ||
653 | |a Operations Research | ||
653 | |a Luenberger | ||
653 | |a Optimization Models | ||
689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Lineare Ordnung |0 (DE-588)4167706-7 |D s |
689 | 1 | 1 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
689 | 1 | |8 1\p |5 DE-604 | |
689 | 2 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 2 | 1 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
689 | 2 | |8 2\p |5 DE-604 | |
700 | 1 | |a Ye, Yinyu |e Verfasser |0 (DE-588)170450880 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-319-18842-3 |
830 | 0 | |a International series in operations research & management science |v 228 |w (DE-604)BV011630976 |9 228 | |
856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=5202445&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
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=028364056&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-028364056 |
Datensatz im Suchindex
_version_ | 1806332632852594688 |
---|---|
adam_text |
Titel: Linear and nonlinear programming
Autor: Luenberger, David G
Jahr: 2016
David G. Luenberger · Yinyu Ye
Linear and Nonlinear
Programming
Fourth Edition
ö Springer
Contents
1 Introduction 1
1.1 Optimization 1
1.2 Types of Problems 2
1.3 Size of Problems 5
1.4 Iterative Algorithms and Convergence 6
Part I Linear Programming
2 Basic Properties of Linear Programs 11
2.1 Introduction 11
2.2 Examples of Linear Programming Problems 14
2.3 Basic Solutions 19
2.4 The Fundamental Theorem of Linear Programming 20
2.5 Relations to Convexity 23
2.6 Exercises 27
3 The Simplex Method 33
3.1 Pivots 33
3.2 Adjacent Extreme Points 38
3.3 Determining a Minimum Feasible Solution 42
3.4 Computational Procedure: Simplex Method 45
3.5 Rinding a Basic Feasible Solution 49
3.6 Matrix Form of the Simplex Method 54
3.7 Simplex Method for Transportation Problems 56
3.8 Decomposition 68
3.9 Summary 72
3.10 Exercises 73
4 Duality and Complementarity 83
4.1 Dual Linear Programs 83
4.2 The Duality Theorem 86
ix
x Contents
4.3 Relations to the Simplex Procedura 88
4.4 Sensitivity and Complementary Slackness 92
4.5 Max Flow-Min Cut Theorem 94
4.6 The Dual Simplex Method 100
4.7 *The Primal-Dual Algorithm 102
4.8 Summary 106
4.9 Exercises 107
5 Inferior-Point Methods 115
5.1 Elements of Complexity Theory 117
5.2 *The Simplex Method Is Not Polynomial-Time 118
5.3 *The Ellipsoid Method 119
5.4 The Analytic Center 123
5.5 The Central Path 125
5.6 Solution Strategien 130
5.7 Termination and Initialization 137
5.8 Summary 142
5.9 Exercises 143
6 Conic Linear Programming 149
6.1 ConvexCones 149
6.2 Conic Linear Programming Problem 150
6.3 Parkas' Lemma for Conic Linear Programming 154
6.4 Conic Linear Programming Duality 158
6.5 Complementarity and Solution Rank of SDP 166
6.6 Interior-Point Algorithms for Conic Linear Programming 170
6.7 Summary 173
6.8 Exercises 174
Part II Unconstrained Problems
7 Basic Properties ofSolutions and Algorithms 179
7.1 First-Order Necessary Conditions 180
7.2 Examples of Unconstrained Problems 182
7.3 Second-Order Conditions 185
7.4 Convex and Concave Functions 188
7.5 Minimization and Maximization of Convex Functions 192
7.6 *Zero-Order Conditions 194
7.7 Global Convergence of Descent Algorithms 196
7.8 Speed of Convergence 204
7.9 Summary 209
7.10 Exercises 209
Contents xi
8 Basic Descent Methods 213
8.1 Line Search Algorithms 214
8.2 The Method of Steepest Descent 229
8.3 Applications of the Convergence Theory 239
8.4 Accelerated Steepest Descent 243
8.5 Newton's Method 245
8.6 Coordinate Descent Methods 252
8.7 Summary 257
8.8 Exercises 258
9 Conjugate Direction Methods 263
9.1 Conjugate Directions 263
9.2 Descent Properties of the Conjugate Direction Method 266
9.3 The Conjugate Gradient Method 268
9.4 The C-G Method as an Optimal Process 270
9.5 The Partial Conjugate Gradient Method 273
9.6 Extension to Nonquadratic Problems 276
9.7 *Parallel Tangents 279
9.8 Exercises 281
10 Quasi-Newton Methods 285
10.1 Modified Newton Method 286
10.2 Construction of the Inverse 288
10.3 Davidon-Fletcher-Powell Method 290
10.4 The Broyden Family 293
10.5 Convergence Properties 296
10.6 Scaling 300
10.7 Memoryless Quasi-Newton Methods 304
10.8 *Combination of Steepest Descent and Newton's Method 306
10.9 Summary 312
10.10 Exercises 313
Part III Constrained Minimization
11 Constrained Minimization Conditions 321
11.1 Constraints 321
11.2 Tangent Plane 323
11.3 First-Order Necessary Conditions (Equality Constraints) 326
11.4 Examples 327
11.5 Second-Order Conditions 333
11.6 Eigenvalues in Tangent Subspace 335
11.7 Sensitivity 338
11.8 Inequality Constraints 340
11.9 Zero-Order Conditions and Lagrangian Relaxation 344
11.10 Summary 351
11.11 Exercises 352
xii Contents
12 Primal Methods 357
12.1 Advantage of Primal Methods 357
12.2 Feasible Direction Methods 358
12.3 Active Set Methods 360
12.4 The Gradient Projection Method 364
12.5 Convergence Rate of the Gradient Projection Method 370
12.6 The Reduced Gradient Method 378
12.7 Convergence Rate of the Reduced Gradient Method 383
12.8 *Variations 390
12.9 Summary 392
12.10 Exercises 392
13 Penalty and Barrier Methods 397
13.1 Penalty Methods 398
13.2 Barrier Methods 401
13.3 Properties of Penalty and Barrier Functions 403
13.4 Newton's Method and Penalty Functions 412
13.5 Conjugate Gradients and Penalty Methods 413
13.6 Normalization of Penalty Functions 415
13.7 Penalty Functions and Gradient Projection 417
13.8 *Exact Penalty Functions 421
13.9 Summary 423
13.10 Exercises 425
14 Duality and Dual Methods 429
14.1 Global Duality 430
14.2 Local Duality 435
14.3 Canonical Convergence Rate of Dual Steepest Ascent 440
14.4 Separable Problems and Their Duals 441
14.5 Augmented Lagrangian 445
14.6 The Method of Multipliers 449
14.7 The Alternating Direction Method of Multipliers 454
14.8 *Cutting Plane Methods 458
14.9 Exercises 464
15 Primal-Dual Methods 467
15.1 The Standard Problem 467
15.2 A Simple Merit Function 470
15.3 Basic Primal-Dual Methods 471
15.4 Modified Newton Methods 477
15.5 Descent Properties 478
15.6 * Rate of Convergence 483
15.7 Primal-Dual Interior Point Methods 485
15.8 Summary 488
15.9 Exercises 489
Contents xiii
A Mathematical Review 495
A.l Sets 495
A.2 Matrix Notation 496
A.3 Spaces 497
A.4 Eigenvalues and Quadratic Forms 498
A.5 Topological Concepts 499
A.6 Functions 500
B Convex Sets 505
B.l Basic Definitions 505
B.2 Hyperplanes and Polytopes 507
B.3 Separating and Supporting Hyperplanes 509
B.4 Extreme Points 511
C Gaussian Elimination 513
D Basic Network Concepts 517
D.l Flows in Networks 519
D.2 Tree Procedure 519
D.3 Capacitated Networks 521
Bibliography 523
Index 539 |
any_adam_object | 1 |
author | Luenberger, David G. 1937- Ye, Yinyu |
author_GND | (DE-588)135911338 (DE-588)170450880 |
author_facet | Luenberger, David G. 1937- Ye, Yinyu |
author_role | aut aut |
author_sort | Luenberger, David G. 1937- |
author_variant | d g l dg dgl y y yy |
building | Verbundindex |
bvnumber | BV042937459 |
classification_rvk | SK 870 |
ctrlnum | (OCoLC)927102532 (DE-599)DNB1069433403 |
dewey-full | 519.72 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.72 |
dewey-search | 519.72 |
dewey-sort | 3519.72 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik Wirtschaftswissenschaften |
edition | 4. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV042937459</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170807</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">151020s2016 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1069433403</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3319188410</subfield><subfield code="9">3-319-18841-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319188416</subfield><subfield code="c">Gb. : ca. EUR 96.29 (DE) (freier Pr.), ca. EUR 98.99 (AT) (freier Pr.), ca. sfr 99.50 (freier Pr.)</subfield><subfield code="9">978-3-319-18841-6</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783319188416</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 978-3-319-18841-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)927102532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1069433403</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.72</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">330</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Luenberger, David G.</subfield><subfield code="d">1937-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135911338</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear and nonlinear programming</subfield><subfield code="c">David G. Luenberger ; Yinyu Ye</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 546 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">235 mm x 155 mm, 0 g</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">228</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="650" ind1="0" ind2="7"><subfield code="a">Nichtlineare Optimierung</subfield><subfield code="0">(DE-588)4128192-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lineare Ordnung</subfield><subfield code="0">(DE-588)4167706-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Research ; Zielgruppe</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">TBC ; BIC Subject Heading</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Semidefinite Programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear Programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nonlinear Programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical Programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Operations Research</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Luenberger</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization Models</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Lineare Ordnung</subfield><subfield code="0">(DE-588)4167706-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Nichtlineare Optimierung</subfield><subfield code="0">(DE-588)4128192-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2="1"><subfield code="a">Nichtlineare Optimierung</subfield><subfield code="0">(DE-588)4128192-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ye, Yinyu</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170450880</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-319-18842-3</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">International series in operations research & management science</subfield><subfield code="v">228</subfield><subfield code="w">(DE-604)BV011630976</subfield><subfield code="9">228</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=5202445&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=028364056&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028364056</subfield></datafield></record></collection> |
id | DE-604.BV042937459 |
illustrated | Illustrated |
indexdate | 2024-08-03T02:43:58Z |
institution | BVB |
isbn | 3319188410 9783319188416 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028364056 |
oclc_num | 927102532 |
open_access_boolean | |
owner | DE-11 DE-92 DE-384 DE-634 DE-19 DE-BY-UBM DE-20 DE-83 |
owner_facet | DE-11 DE-92 DE-384 DE-634 DE-19 DE-BY-UBM DE-20 DE-83 |
physical | XIII, 546 S. graph. Darst. 235 mm x 155 mm, 0 g |
publishDate | 2016 |
publishDateSearch | 2016 |
publishDateSort | 2016 |
publisher | Springer |
record_format | marc |
series | International series in operations research & management science |
series2 | International series in operations research & management science |
spelling | Luenberger, David G. 1937- Verfasser (DE-588)135911338 aut Linear and nonlinear programming David G. Luenberger ; Yinyu Ye 4. ed. Cham [u.a.] Springer 2016 XIII, 546 S. graph. Darst. 235 mm x 155 mm, 0 g txt rdacontent n rdamedia nc rdacarrier International series in operations research & management science 228 Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Nichtlineare Optimierung (DE-588)4128192-5 gnd rswk-swf Lineare Ordnung (DE-588)4167706-7 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Research ; Zielgruppe TBC ; BIC Subject Heading Semidefinite Programming Linear Programming Nonlinear Programming Mathematical Programming Operations Research Luenberger Optimization Models Optimierung (DE-588)4043664-0 s DE-604 Lineare Ordnung (DE-588)4167706-7 s Nichtlineare Optimierung (DE-588)4128192-5 s 1\p DE-604 Lineare Optimierung (DE-588)4035816-1 s 2\p DE-604 Ye, Yinyu Verfasser (DE-588)170450880 aut Erscheint auch als Online-Ausgabe 978-3-319-18842-3 International series in operations research & management science 228 (DE-604)BV011630976 228 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=5202445&prov=M&dok_var=1&dok_ext=htm Inhaltstext HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028364056&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Luenberger, David G. 1937- Ye, Yinyu Linear and nonlinear programming International series in operations research & management science Lineare Optimierung (DE-588)4035816-1 gnd Nichtlineare Optimierung (DE-588)4128192-5 gnd Lineare Ordnung (DE-588)4167706-7 gnd Optimierung (DE-588)4043664-0 gnd |
subject_GND | (DE-588)4035816-1 (DE-588)4128192-5 (DE-588)4167706-7 (DE-588)4043664-0 |
title | Linear and nonlinear programming |
title_auth | Linear and nonlinear programming |
title_exact_search | Linear and nonlinear programming |
title_full | Linear and nonlinear programming David G. Luenberger ; Yinyu Ye |
title_fullStr | Linear and nonlinear programming David G. Luenberger ; Yinyu Ye |
title_full_unstemmed | Linear and nonlinear programming David G. Luenberger ; Yinyu Ye |
title_short | Linear and nonlinear programming |
title_sort | linear and nonlinear programming |
topic | Lineare Optimierung (DE-588)4035816-1 gnd Nichtlineare Optimierung (DE-588)4128192-5 gnd Lineare Ordnung (DE-588)4167706-7 gnd Optimierung (DE-588)4043664-0 gnd |
topic_facet | Lineare Optimierung Nichtlineare Optimierung Lineare Ordnung Optimierung |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=5202445&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028364056&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV011630976 |
work_keys_str_mv | AT luenbergerdavidg linearandnonlinearprogramming AT yeyinyu linearandnonlinearprogramming |