Robust optimization

Known as: Robust optimisation 
Robust optimization is a field of optimization theory that deals with optimization problems in which a certain measure of robustness is sought… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2017
010020019912017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Unit commitment, one of the most critical tasks in electric power system operations, faces new challenges as the supply and… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • table III
Is this relevant?
Highly Cited
2010
Highly Cited
2010
<lb>In this paper, we focus on a linear optimization problem with uncertainties, having expectations<lb>in the objective and in… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper, we propose a methodology for constructing uncertainty sets within the framework of robust optimization for linear… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
W propose the use of robust optimization (RO) as a powerful methodology for multiperiod stochastic operations management problems… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We propose new methodologies in robust optimization that promise greater tractability, both theoretically and practically than… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly perturbed. We… (More)
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstoLorg… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?