Atjaunināt sīkdatņu piekrišanu

Robust Discrete Optimization and Its Applications 1997 ed. [Hardback]

  • Formāts: Hardback, 358 pages, height x width: 234x156 mm, weight: 1570 g, XVI, 358 p., 1 Hardback
  • Sērija : Nonconvex Optimization and Its Applications 14
  • Izdošanas datums: 30-Nov-1996
  • Izdevniecība: Springer
  • ISBN-10: 0792342917
  • ISBN-13: 9780792342915
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 270,03 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 317,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 358 pages, height x width: 234x156 mm, weight: 1570 g, XVI, 358 p., 1 Hardback
  • Sērija : Nonconvex Optimization and Its Applications 14
  • Izdošanas datums: 30-Nov-1996
  • Izdevniecība: Springer
  • ISBN-10: 0792342917
  • ISBN-13: 9780792342915
Citas grāmatas par šo tēmu:
Presents a comprehensive mathematical programming framework for a robust approach to decision making in environments of significant data uncertainty, emphasizing operating and production management. The approach assumes that the decision maker possesses inadequate knowledge about the random state of nature, and so develops a decision that hedges against the worst contingency that can be imagined. Applies the decision support tools and solution methods to such contexts as linear programming, assignment problems, shortest paths, minimum spanning trees, knapsack problems, resource allocation, scheduling, inventory, and international sourcing. No index. Annotation c. by Book News, Inc., Portland, Or.

This book deals with decision making in environments of significant data uncertainty, with particular emphasis on operations and production management applications. For such environments, we suggest the use of the robustness approach to decision making, which assumes inadequate knowledge of the decision maker about the random state of nature and develops a decision that hedges against the worst contingency that may arise. Robust Discrete Optimization is a comprehensive mathematical programming framework for robust decision making. This book takes a giant first step in presenting decision support tools and solution methods for generating robust decisions in a variety of interesting application environments such as: linear programming, assignment problems, shortest paths, minimum spanning trees, knapsack problems, resource allocation, scheduling, production planning, location, inventory, layout planning, network design, and international sourcing. Beyond theoretical results, the book provides many suggestions and useful advice to the practitioners of the robustness approach. Emphasis is placed upon the assessment of the decision environment for applicability of the approach, structuring of data uncertainty and the scenario generation process, choice of appropriate robustness criteria, and formulation and solution of robust decision problems. Audience: The book will be of interest to researchers, practitioners and graduate students working in the fields of operations research, management science, industrial and systems engineering, computer science, decision analysis and applied mathematics.

Recenzijas

`....I recommend the book, which in large parts is easy to read, as a consistent and interesting entry into the field of robust optimization.' OR Spektrum, 20:278 (1998)

DEDICATION v(6)
PREFACE xi(4)
ACKNOWLEDGMENTS xv
1 APPROACHES FOR HANDLING UNCERTAINTY IN DECISION MAKING
1(25)
1.1 Traditional Approaches for Handling Uncertainty in Decision Making
1(7)
1.2 A Formal Definition of the Robustness Approach
8(3)
1.3 Robust Decision Making Framework
11(6)
1.4 Motivate the Robustness Approach Through International Sourcing Applications
17(6)
1.5 A Brief Guide Through Related Literature
23(1)
REFERENCES
24(2)
2 A ROBUST DISCRETE OPTIMIZATION FRAMEWORK
26(48)
2.1 The Robust Discrete Optimization Problem
26(33)
2.2 Efficiency and Expected Performance of Robust Solutions
59(10)
2.3 A Brief Guide Through Related Literature
69(1)
REFERENCES
70(4)
3 COMPUTATIONAL COMPLEXITY RESULTS OF ROBUST DISCRETE OPTIMIZATION PROBLEMS
74(42)
3.1 Complexity Results for the Robust Assignment Problem
76(1)
3.2 Complexity Results for the Robust Shortest Path Problem
77(8)
3.3 Complexity Results for the Robust Minimum Spanning Tree Problem
85(5)
3.4 Complexity Results for the Robust Resource Allocation Problem
90(5)
3.5 Complexity Results for the Robust Machine Scheduling Problem
95(5)
3.6 Complexity Results for the Robust Multi-period Production Planning Problem
100(3)
3.7 Complexity Results for the Robust Knapsack Problem
103(4)
3.8 Complexity Results for the Robust Multi-Item Newsvendor Problem
107(4)
3.9 A Brief Guide Through Related Literature
111(2)
REFERENCES
113(3)
4 EASILY SOLVABLE CASES OF ROBUST DISCRETE OPTIMIZATION PROBLEMS
116(37)
4.1 Robust 1-Median Location Problem on a Tree
116(6)
4.2 Robust Multi-period Production Planning with Demand Uncertainty
122(2)
4.3 Robust Economic Order Quantity (EOQ) Model
124(13)
4.4 Robust Newsvendor Problems
137(5)
4.5 Robust Multi-Item Newsvendor Models with a Budget Constraint and Interval Demand Data
142(5)
4.6 Parameter Robust Distribution Free Newsvendor Models
147(3)
4.7 A Brief Guide Through Related Literature
150(1)
REFERENCES
151(2)
5 ALGORITHMIC DEVELOPMENTS FOR DIFFICULT ROBUST DISCRETE OPTIMIZATION PROBLEMS
153(40)
5.1 A Surrogate Relaxation Based Branch-and-Bound Method
153(7)
5.2 An Approximation Algorithm
160(8)
5.3 Computational Results
168(23)
5.4 A Brief Guide Through Related Literature
191(1)
REFERENCES
192(1)
6 ROBUST 1-MEDIAN LOCATION PROBLEMS: DYNAMIC ASPECTS AND UNCERTAINTY
193(48)
6.1 Notation, Problem Formulation and Basic Results
197(7)
6.2 Robust 1-Median with Linear Node Demands and Edge Distances
204(5)
6.3 Robust 1-Median with Linear Node Demands
209(6)
6.4 Robust 1-Median with Linear Edge Distances
215(6)
6.5 Observations on Uncertain Node Demands and Edge Distances, and Conclusions on Robust 1-Median with Discrete Scenarios
221(2)
6.6 Robust 1-Median Problem on a Tree with Interval Input Data
223(12)
6.7 Robust 1-Median on a Tree with Mixed Scenarios
235(2)
6.8 A Brief Guide Through Related Literature
237(2)
REFERNCES
239(2)
7 ROBUST SCHEDULING PROBLEMS
241(49)
7.1 Properties of Robust Schedules for Single Machine Scheduling with Interval Processing Time Data
243(6)
7.2 Properties of Robust Schedules for Two Machine Flowshop Scheduling with Interval Processing Time Data
249(5)
7.3 Algorithms for the Robust Single Machine Scheduling Problem with Interval Processing Time Data
254(12)
7.4 Algorithms for the Robust Two Machine Flowshop Scheduling Problem with Interval Processing Time Data
266(11)
7.5 Algorithms for the Robust Two Machine Flowshop Scheduling Problem with Discrete Processing Time Data
277(9)
7.6 A Brief Guide Through Related Literature
286(3)
REFERENCES
289(1)
8 ROBUST UNCAPACITATED NETWORK DESIGN AND INTERNATIONAL SOURCING PROBLEMS
290(43)
8.1 Notation and Problem Formulation of Uncapacitated Network Design Problems
292(2)
8.2 Adaptation of the Benders Decomposition Methodology to the Generation of Robust Network Designs
294(5)
8.3 A Multi-Master Benders Algorithm For Robust Uncapacitated Network Design Problems
299(6)
8.4 Robust Network Designs and the Expected Cost Uncapacitated Network Design Problem
305(1)
8.5 Computational Results
306(9)
8.6 Notation and Formulation of Robust International Sourcing Problem
315(3)
8.7 An Algorithm to Generate the N Best Robust Solutions to the International Sourcing Problem
318(4)
8.8 Computational Performance of the Robust International Sourcing Algorithm
322(4)
8.9 Managerial Uses of the Robust International Sourcing Model
326(3)
8.10 A Brief Guide Through Related Literature
329(2)
REFERENCES
331(2)
9 ROBUST DISCRETE OPTIMIZATION: PAST SUCCESSES AND FUTURE CHALLENGES
333
9.1 Summary of Main Results
334(9)
9.2 Implementation Considerations of the Robustness Approach
343(8)
9.3 Future Research Directions
351