Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Niraj Ramesh Dayama; Ketki Kulkarni

doi:10.1007/978-3-642-35926-2_9

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Niraj Ramesh Dayama^*, Ketki Kulkarni

^*Corresponding author for this work

HUMLOG - The Humanitarian Logistics and Supply Chain Research Institute, Helsinki

Indian Institute of Technology Bombay

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

Abstract

Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.

Original language	English
Title of host publication	Combinatorial Algorithms : 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers
Editors	S. Arumugam, W.F. Smyth
Number of pages	5
Publisher	Springer
Publication date	2012
Pages	76-80
ISBN (Print)	978-3-642-35925-5
DOIs	https://doi.org/10.1007/978-3-642-35926-2_9
Publication status	Published - 2012
MoE publication type	A4 Article in conference proceedings
Event	23rd International Workshop on Combinatorial Algorithms, IWOCA 2012 - Tamil Nadu, India Duration: 19.07.2012 → 21.07.2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7643 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

113 Computer and information sciences

Access to Document

10.1007/978-3-642-35926-2_9

OpenUrl availability

Full text

Cite this

Dayama, N. R., & Kulkarni, K. (2012). Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. In S. Arumugam, & W. F. Smyth (Eds.), Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers (pp. 76-80). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7643 LNCS). Springer. https://doi.org/10.1007/978-3-642-35926-2_9

Dayama, Niraj Ramesh ; Kulkarni, Ketki. / Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. editor / S. Arumugam ; W.F. Smyth. Springer, 2012. pp. 76-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{db03bbbd3dd549d68dcbd20a0ab6ec31,

title = "Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances",

abstract = "Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.",

keywords = "113 Computer and information sciences",

author = "Dayama, {Niraj Ramesh} and Ketki Kulkarni",

year = "2012",

doi = "10.1007/978-3-642-35926-2_9",

language = "English",

isbn = "978-3-642-35925-5",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "76--80",

editor = "S. Arumugam and W.F. Smyth",

booktitle = "Combinatorial Algorithms",

address = "International",

note = "23rd International Workshop on Combinatorial Algorithms, IWOCA 2012 ; Conference date: 19-07-2012 Through 21-07-2012",

}

Dayama, NR & Kulkarni, K 2012, Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. in S Arumugam & WF Smyth (eds), Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7643 LNCS, Springer, pp. 76-80, 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, Tamil Nadu, India, 19.07.2012. https://doi.org/10.1007/978-3-642-35926-2_9

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. / Dayama, Niraj Ramesh; Kulkarni, Ketki.
Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. ed. / S. Arumugam; W.F. Smyth. Springer, 2012. p. 76-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7643 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

AU - Dayama, Niraj Ramesh

AU - Kulkarni, Ketki

PY - 2012

Y1 - 2012

N2 - Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.

AB - Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.

KW - 113 Computer and information sciences

UR - http://www.scopus.com/inward/record.url?scp=84871667173&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-35926-2_9

DO - 10.1007/978-3-642-35926-2_9

M3 - Conference contribution

AN - SCOPUS:84871667173

SN - 978-3-642-35925-5

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 80

BT - Combinatorial Algorithms

A2 - Arumugam, S.

A2 - Smyth, W.F.

PB - Springer

T2 - 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012

Y2 - 19 July 2012 through 21 July 2012

ER -

Dayama NR, Kulkarni K. Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. In Arumugam S, Smyth WF, editors, Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. Springer. 2012. p. 76-80. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-35926-2_9

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Abstract

Publication series

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Cite this