Robust Discrete Optimization: Past Successes and Future Challenges

  • Panos Kouvelis
  • Gang Yu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 14)


It has been a long way since the first few pages where we started describing, and you as the reader got gradually exposed to, the concept of robustness and the main elements of robust discrete optimization. We hope that by now you, the reader, feel enlightened on the topic and intrigued by its challenges, but to be sincere, we, the authors, feel tired. But, we still feel we will not be doing justice to the topic, and definitely not serve our readers, if we do not write that final, the so typically called “Conclusion and Future Directions,” chapter. So here we are putting the last touches on a painting that stayed in our minds, and bothered our sleep, for the last three years.


Order Quantity Robust Optimization Interval Data Robust Solution Decision Environment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Panos Kouvelis
    • 1
  • Gang Yu
    • 2
  1. 1.Olin School of BusinessWashington University at St. LouisSt. LouisUSA
  2. 2.Center for Cybernetic StudiesThe University of TexasAustinUSA

Personalised recommendations