Robust discrete optimization and its applications (Q1353370)

From MaRDI portal





scientific article; zbMATH DE number 1005352
Language Label Description Also known as
default for all languages
No label defined
    English
    Robust discrete optimization and its applications
    scientific article; zbMATH DE number 1005352

      Statements

      Robust discrete optimization and its applications (English)
      0 references
      0 references
      0 references
      29 April 1997
      0 references
      The book deals with decision environments of data uncertainty with emphasis on operations management applications. The authors suggest the robustness approach to decision making. The book has nine chapters with references given at the end of each chapter. Chapter 1 introduces the concept of the robustness approach and its format definition. Chapter 2 presents a variety of problems for which the formulation of robust discrete optimization framework applies. Chapter 3 discusses complexity results on many classes of robust discrete optimization problems which are difficult to solve in general. Chapter 4 describes six polynomially solvable problems. Chapter 5 is restricted to robust discrete optimization problems with equivalent single scenario problems that can be solved efficiently with a polynomial or pseudo-polynomial procedure based on branch-and-bound with both upper and lower bounds generated by surrogate relaxation. Chapter 6 proposes a unifying approach for incorporating dynamic and uncertain aspects in the location decision making process by focussing on the robust 1-median location problem on a tree. Chapter 7 concentrates on robust single machine and two machine flowshop scheduling problems. Chapter 8 presents ways to adapt the Benders decomposition methodology to solve the robust network design problems. Chapter 9 summarizes the main results of the book and suggests some future research directions in robust discrete optimization.
      0 references
      robustness
      0 references
      decision making
      0 references
      robust discrete optimization
      0 references
      polynomially solvable problems
      0 references
      branch-and-bound
      0 references
      location decision
      0 references
      1-median location problem on a tree
      0 references
      flowshop scheduling
      0 references
      Benders decomposition
      0 references
      robust network design
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references