Linear and nonlinear programming:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer
2008
|
| Ausgabe: | 3. ed. |
| Schriftenreihe: | International series in operations research & management science
116 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Auch als Internetausgabe |
| Beschreibung: | XIII, 546 S. Ill., graph. Darst. |
| ISBN: | 9780387745022 0387745025 9780387745039 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV022969870 | ||
| 003 | DE-604 | ||
| 005 | 20140623 | ||
| 007 | t | ||
| 008 | 071116s2008 gw ad|| |||| 00||| eng d | ||
| 015 | |a 07,N33,0049 |2 dnb | ||
| 016 | 7 | |a 985051531 |2 DE-101 | |
| 020 | |a 9780387745022 |c Gb. : ca. EUR 81.59 (freier Pr.), ca. sfr 133.00 (freier Pr.) |9 978-0-387-74502-2 | ||
| 020 | |a 0387745025 |c Gb. : ca. EUR 81.59 (freier Pr.), ca. sfr 133.00 (freier Pr.) |9 0-387-74502-5 | ||
| 020 | |a 9780387745039 |9 978-0-387-74503-9 | ||
| 024 | 3 | |a 9780387745022 | |
| 028 | 5 | 2 | |a 11053422 |
| 035 | |a (OCoLC)171549627 | ||
| 035 | |a (DE-599)DNB985051531 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-703 |a DE-739 |a DE-384 |a DE-573 |a DE-634 |a DE-20 |a DE-91G |a DE-11 |a DE-355 |a DE-29T |a DE-706 |a DE-859 |a DE-83 | ||
| 050 | 0 | |a T57.7 | |
| 082 | 0 | |a 519.72 |2 22 | |
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 084 | |a QH 421 |0 (DE-625)141575: |2 rvk | ||
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a MAT 910f |2 stub | ||
| 084 | |a 90C30 |2 msc | ||
| 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 3. ed. | ||
| 264 | 1 | |a New York, NY |b Springer |c 2008 | |
| 300 | |a XIII, 546 S. |b Ill., 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 116 | |
| 500 | |a Auch als Internetausgabe | ||
| 650 | 4 | |a Linear programming | |
| 650 | 4 | |a Nonlinear programming | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lineare Optimierung |0 (DE-588)4035816-1 |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 Nichtlineare Optimierung |0 (DE-588)4128192-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Lineare Ordnung |0 (DE-588)4167706-7 |D s |
| 689 | 0 | 1 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
| 689 | 1 | 1 | |a Nichtlineare Optimierung |0 (DE-588)4128192-5 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Ye, Yinyu |e Verfasser |4 aut | |
| 830 | 0 | |a International series in operations research & management science |v 116 |w (DE-604)BV011630976 |9 116 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016174131&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016174131 | ||
| 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 | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804137220997644288 |
|---|---|
| adam_text | CONTENTS
Chapter
1.
Introduction
1.1.
Optimization
1.2.
Types of Problems
1.3.
Size of Problems
1.4.
Iterative Algorithms and Convergence
PART I Linear Programming
Chapter
2.
Chapter
3.
Chapter
4.
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
22
2.6.
Exercises
28
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
46
3.5.
Artificial Variables
50
3.6.
Matrix Form of the Simplex Method
54
3.7.
The Revised Simplex Method
56
3.8.
The Simplex Method and
LU
Decomposition
59
3.9.
Decomposition
62
3.10.
Summary
70
3.11.
Exercises
70
Duality
79
4.1.
Dual Linear Programs
79
4.2.
The Duality Theorem
82
4.3.
Relations to the Siirrolex Procedure
84
4.4.
Sensitivity and Complementary Slackness
*4.5. The Dual Simplex Method
ix
90
Contents
Chapter
5.
Chapter
6.
4.6.
The Primal-Dual Algorithm
93
*4.7.
Reduction of Linear Inequalities
98
4.8.
Exercises
103
Interior-Point Methods
111
5.1.
Elements of Complexity Theory
112
*5.2.
The Simplex Method is not Polynomial-Time
114
*5.3.
The Ellipsoid Method
115
5.4.
The Analytic Center
118
5.5.
The Central Path
121
5.6.
Solution Strategies
126
5.7.
Termination and Initialization
134
5.8.
Summary
139
5.9.
Exercises
140
Transportation and Network Flow Problems
145
6.1.
The Transportation Problem
145
6.2.
Finding a Basic Feasible Solution
148
6.3.
Basis Triangularity
150
6.4.
Simplex Method for Transportation Problems
153
6.5.
The Assignment Problem
159
6.6.
Basic Network Concepts
160
6.7.
Minimum Cost Flow
162
6.8.
Maximal Flow
166
6.9.
Summary
174
6.10.
Exercises
175
PART II Unconstrained Problems
Chapter
7.
Basic Properties of Solutions and Algorithms
183
7.1.
First-Order Necessary Conditions
184
7.2.
Examples of Unconstrained Problems
186
7.3.
Second-Order Conditions
190
7.4.
Convex and Concave Functions
192
7.5.
Minimization and Maximization of Convex Functions
197
7.6.
Zero-Order Conditions
198
7.7.
Global Convergence of Descent Algorithms
201
7.8.
Speed of Convergence
208
7.9.
Summary
212
7.10.
Exercises
213
Chapter
8.
Basic Descent Methods
8.1.
Fibonacci and Golden Section Search
8.2.
Line Search by Curve Fitting
8.3.
Global Convergence of Curve Fitting
8.4.
Closedness of Line Search Algorithms
8.5.
Inaccurate Line Search
8.6.
The Method of Steepest Descent
215
216
219
226
228
230
233
Contents
XI
8.7.
Applications
of the
Theory
8.8.
Newton s Method
8.9.
Coordinate Descent
Methods
8.10.
Spacer Steps
8.11.
Summary
8.12.
Exercises
242
246
253
255
256
257
Chapter
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
С
-G
Method as an Optimal Process
271
9.5.
The Partial Conjugate Gradient Method
273
9.6.
Extension to Nonquadratic Problems
277
9.7.
Parallel Tangents
279
9.8.
Exercises
282
Chapter
10.
Quasi-Newton
Methods
285
10.1.
Modified Newton Method
285
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
299
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
Chapter
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
339
11.8.
Inequality Constraints
341
11.9.
Zero-Order Conditions and
Lagrange
Multipliers
346
11.10.
Summary
353
11.11.
Exercises
354
Chapter
12.
Primal Methods
359
12.1.
Advantage of Primal Methods
359
12.2.
Feasible Direction Methods
360
12.3.
Active Set Methods
363
xii
Contents
12.4. The Gradient
Projection Method
12.5.
Convergence Rate of the Gradient Projection Method
12.6.
The Reduced Gradient Method
12.7.
Convergence Rate of the Reduced Gradient Method
12.8.
Variations
12.9.
Summary
12.10.
Exercises
367
374
382
387
394
396
396
Chapter
13.
Penalty and Barrier Methods
13.1.
Penalty Methods
13.2.
Barrier Methods
13.3.
Properties of Penalty and Barrier Functions
13.4.
Newton s Method and Penalty Functions
13.5.
Conjugate Gradients and Penalty Methods
13.6.
Normalization of Penalty Functions
13.7.
Penalty Functions and Gradient Projection
13.8.
Exact Penalty Functions
13.9.
Summary
13.10.
Exercises
401
402
405
407
416
418
420
421
425
429
430
Chapter
14.
Dual and Cutting Plane Methods
14.1.
Global Duality
14.2.
Local Duality
14.3.
Dual Canonical Convergence Rate
14.4.
Separable Problems
14.5.
Augmented Lagrangians
14.6.
The Dual Viewpoint
14.7.
Cutting Plane Methods
14.8.
Kelley s Convex Cutting Plane Algorithm
14.9.
Modifications
14.10.
Exercises
435
435
441
446
447
451
456
460
463
465
466
Chapter
15.
Primal-Dual Methods
15.1.
The Standard Problem
15.2.
Strategies
15.3.
A Simple Merit Function
15.4.
Basic Primal-Dual Methods
15.5.
Modified Newton Methods
15.6.
Descent Properties
15.7.
Rate of Convergence
15.8.
Interior Point Methods
15.9.
Semidefinite
Programming
15.10.
Summary
15.11.
Exercises
469
469
471
472
474
479
481
485
487
491
498
499
Appendix A. Mathematical Review
A.I. Sets
A.2. Matrix Notation
A.3. Spaces
507
507
508
509
Appendix
В.
Bibliography
Index
Contents
xiii
A.4.
A.5.
A.6.
Eigenvalues and Quadratic Forms
Topological Concepts
Functions
510
511
512
Convex Sets
B.I. Basic Definitions
B.2.
Hyperplanes
and Polytopes
B.3. Separating and Supporting
Hyperplanes
В
.4.
Extreme Points
515
515
517
519
521
Gaussian Elimination
523
527
541
|
| adam_txt |
CONTENTS
Chapter
1.
Introduction
1.1.
Optimization
1.2.
Types of Problems
1.3.
Size of Problems
1.4.
Iterative Algorithms and Convergence
PART I Linear Programming
Chapter
2.
Chapter
3.
Chapter
4.
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
22
2.6.
Exercises
28
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
46
3.5.
Artificial Variables
50
3.6.
Matrix Form of the Simplex Method
54
3.7.
The Revised Simplex Method
56
3.8.
The Simplex Method and
LU
Decomposition
59
3.9.
Decomposition
62
3.10.
Summary
70
3.11.
Exercises
70
Duality
79
4.1.
Dual Linear Programs
79
4.2.
The Duality Theorem
82
4.3.
Relations to the Siirrolex Procedure
84
4.4.
Sensitivity and Complementary Slackness
*4.5. The Dual Simplex Method
ix
90
Contents
Chapter
5.
Chapter
6.
4.6.
The Primal-Dual Algorithm
93
*4.7.
Reduction of Linear Inequalities
98
4.8.
Exercises
103
Interior-Point Methods
111
5.1.
Elements of Complexity Theory
112
*5.2.
The Simplex Method is not Polynomial-Time
114
*5.3.
The Ellipsoid Method
115
5.4.
The Analytic Center
118
5.5.
The Central Path
121
5.6.
Solution Strategies
126
5.7.
Termination and Initialization
134
5.8.
Summary
139
5.9.
Exercises
140
Transportation and Network Flow Problems
145
6.1.
The Transportation Problem
145
6.2.
Finding a Basic Feasible Solution
148
6.3.
Basis Triangularity
150
6.4.
Simplex Method for Transportation Problems
153
6.5.
The Assignment Problem
159
6.6.
Basic Network Concepts
160
6.7.
Minimum Cost Flow
162
6.8.
Maximal Flow
166
6.9.
Summary
174
6.10.
Exercises
175
PART II Unconstrained Problems
Chapter
7.
Basic Properties of Solutions and Algorithms
183
7.1.
First-Order Necessary Conditions
184
7.2.
Examples of Unconstrained Problems
186
7.3.
Second-Order Conditions
190
7.4.
Convex and Concave Functions
192
7.5.
Minimization and Maximization of Convex Functions
197
7.6.
Zero-Order Conditions
198
7.7.
Global Convergence of Descent Algorithms
201
7.8.
Speed of Convergence
208
7.9.
Summary
212
7.10.
Exercises
213
Chapter
8.
Basic Descent Methods
8.1.
Fibonacci and Golden Section Search
8.2.
Line Search by Curve Fitting
8.3.
Global Convergence of Curve Fitting
8.4.
Closedness of Line Search Algorithms
8.5.
Inaccurate Line Search
8.6.
The Method of Steepest Descent
215
216
219
226
228
230
233
Contents
XI
8.7.
Applications
of the
Theory
8.8.
Newton's Method
8.9.
Coordinate Descent
Methods
8.10.
Spacer Steps
8.11.
Summary
8.12.
Exercises
242
246
253
255
256
257
Chapter
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
С
-G
Method as an Optimal Process
271
9.5.
The Partial Conjugate Gradient Method
273
9.6.
Extension to Nonquadratic Problems
277
9.7.
Parallel Tangents
279
9.8.
Exercises
282
Chapter
10.
Quasi-Newton
Methods
285
10.1.
Modified Newton Method
285
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
299
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
Chapter
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
339
11.8.
Inequality Constraints
341
11.9.
Zero-Order Conditions and
Lagrange
Multipliers
346
11.10.
Summary
353
11.11.
Exercises
354
Chapter
12.
Primal Methods
359
12.1.
Advantage of Primal Methods
359
12.2.
Feasible Direction Methods
360
12.3.
Active Set Methods
363
xii
Contents
12.4. The Gradient
Projection Method
12.5.
Convergence Rate of the Gradient Projection Method
12.6.
The Reduced Gradient Method
12.7.
Convergence Rate of the Reduced Gradient Method
12.8.
Variations
12.9.
Summary
12.10.
Exercises
367
374
382
387
394
396
396
Chapter
13.
Penalty and Barrier Methods
13.1.
Penalty Methods
13.2.
Barrier Methods
13.3.
Properties of Penalty and Barrier Functions
13.4.
Newton's Method and Penalty Functions
13.5.
Conjugate Gradients and Penalty Methods
13.6.
Normalization of Penalty Functions
13.7.
Penalty Functions and Gradient Projection
13.8.
Exact Penalty Functions
13.9.
Summary
13.10.
Exercises
401
402
405
407
416
418
420
421
425
429
430
Chapter
14.
Dual and Cutting Plane Methods
14.1.
Global Duality
14.2.
Local Duality
14.3.
Dual Canonical Convergence Rate
14.4.
Separable Problems
14.5.
Augmented Lagrangians
14.6.
The Dual Viewpoint
14.7.
Cutting Plane Methods
14.8.
Kelley's Convex Cutting Plane Algorithm
14.9.
Modifications
14.10.
Exercises
435
435
441
446
447
451
456
460
463
465
466
Chapter
15.
Primal-Dual Methods
15.1.
The Standard Problem
15.2.
Strategies
15.3.
A Simple Merit Function
15.4.
Basic Primal-Dual Methods
15.5.
Modified Newton Methods
15.6.
Descent Properties
15.7.
Rate of Convergence
15.8.
Interior Point Methods
15.9.
Semidefinite
Programming
15.10.
Summary
15.11.
Exercises
469
469
471
472
474
479
481
485
487
491
498
499
Appendix A. Mathematical Review
A.I. Sets
A.2. Matrix Notation
A.3. Spaces
507
507
508
509
Appendix
В.
Bibliography
Index
Contents
xiii
A.4.
A.5.
A.6.
Eigenvalues and Quadratic Forms
Topological Concepts
Functions
510
511
512
Convex Sets
B.I. Basic Definitions
B.2.
Hyperplanes
and Polytopes
B.3. Separating and Supporting
Hyperplanes
В
.4.
Extreme Points
515
515
517
519
521
Gaussian Elimination
523
527
541 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Luenberger, David G. 1937- Ye, Yinyu |
| author_GND | (DE-588)135911338 |
| 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 | BV022969870 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.7 |
| callnumber-search | T57.7 |
| callnumber-sort | T 257.7 |
| callnumber-subject | T - General Technology |
| classification_rvk | QH 400 QH 421 SK 870 ST 600 |
| classification_tum | MAT 910f |
| ctrlnum | (OCoLC)171549627 (DE-599)DNB985051531 |
| 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 | Informatik Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Mathematik Wirtschaftswissenschaften |
| edition | 3. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03068nam a2200721 cb4500</leader><controlfield tag="001">BV022969870</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140623 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071116s2008 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N33,0049</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">985051531</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387745022</subfield><subfield code="c">Gb. : ca. EUR 81.59 (freier Pr.), ca. sfr 133.00 (freier Pr.)</subfield><subfield code="9">978-0-387-74502-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387745025</subfield><subfield code="c">Gb. : ca. EUR 81.59 (freier Pr.), ca. sfr 133.00 (freier Pr.)</subfield><subfield code="9">0-387-74502-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387745039</subfield><subfield code="9">978-0-387-74503-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9780387745022</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11053422</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)171549627</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB985051531</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.72</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 421</subfield><subfield code="0">(DE-625)141575:</subfield><subfield code="2">rvk</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">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 910f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C30</subfield><subfield code="2">msc</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">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 546 S.</subfield><subfield code="b">Ill., 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">116</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Auch als Internetausgabe</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear programming</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="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">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">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="689" ind1="0" 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="0" 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="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="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">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">3\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="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">International series in operations research & management science</subfield><subfield code="v">116</subfield><subfield code="w">(DE-604)BV011630976</subfield><subfield code="9">116</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</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=016174131&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-016174131</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="883" ind1="1" ind2=" "><subfield code="8">3\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.BV022969870 |
| illustrated | Illustrated |
| index_date | 2024-07-02T19:08:07Z |
| indexdate | 2024-07-09T21:08:50Z |
| institution | BVB |
| isbn | 9780387745022 0387745025 9780387745039 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016174131 |
| oclc_num | 171549627 |
| open_access_boolean | |
| owner | DE-703 DE-739 DE-384 DE-573 DE-634 DE-20 DE-91G DE-BY-TUM DE-11 DE-355 DE-BY-UBR DE-29T DE-706 DE-859 DE-83 |
| owner_facet | DE-703 DE-739 DE-384 DE-573 DE-634 DE-20 DE-91G DE-BY-TUM DE-11 DE-355 DE-BY-UBR DE-29T DE-706 DE-859 DE-83 |
| physical | XIII, 546 S. Ill., graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| 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 3. ed. New York, NY Springer 2008 XIII, 546 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier International series in operations research & management science 116 Auch als Internetausgabe Linear programming Nonlinear programming Optimierung (DE-588)4043664-0 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Lineare Ordnung (DE-588)4167706-7 gnd rswk-swf Nichtlineare Optimierung (DE-588)4128192-5 gnd rswk-swf 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 Optimierung (DE-588)4043664-0 s 3\p DE-604 Ye, Yinyu Verfasser aut International series in operations research & management science 116 (DE-604)BV011630976 116 Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016174131&sequence=000002&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 3\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 Linear programming Nonlinear programming Optimierung (DE-588)4043664-0 gnd Lineare Optimierung (DE-588)4035816-1 gnd Lineare Ordnung (DE-588)4167706-7 gnd Nichtlineare Optimierung (DE-588)4128192-5 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4035816-1 (DE-588)4167706-7 (DE-588)4128192-5 |
| title | Linear and nonlinear programming |
| title_auth | Linear and nonlinear programming |
| title_exact_search | Linear and nonlinear programming |
| title_exact_search_txtP | 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 | Linear programming Nonlinear programming Optimierung (DE-588)4043664-0 gnd Lineare Optimierung (DE-588)4035816-1 gnd Lineare Ordnung (DE-588)4167706-7 gnd Nichtlineare Optimierung (DE-588)4128192-5 gnd |
| topic_facet | Linear programming Nonlinear programming Optimierung Lineare Optimierung Lineare Ordnung Nichtlineare Optimierung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016174131&sequence=000002&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 |