Convex Approach with Sub-gradient Method to Robust Service System Design

Jaroslav Janáček () and Marek Kvet ()
Additional contact information
Jaroslav Janáček: University of Žilina
Marek Kvet: University of Žilina

A chapter in Operations Research Proceedings 2017, 2018, pp 421-427 from Springer

Abstract: Abstract A robust design of a service system has to be resistant to randomly appearing failures in the network. To achieve the resistance, a finite set of scenarios is generated to cover the most detrimental combinations of failures. The system is designed to minimize the maximal impact of individual scenarios. Since each scenario corresponds to particular objective function, searching for the robust service system design consists in minimizing the maximum of particular objective functions. This problem is hard to be solved. We focus here on handling big size of the original model by employing new approach based on convex combination of scenarios.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_56

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_56

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().