1989
DOI: 10.1029/wr025i002p00152
|View full text |Cite
|
Sign up to set email alerts
|

Is optimization optimistically biased?

Abstract: Does optimization systematically lead to solutions that appear better than they actually turn out to be when implemented? The answer can be yes if there are errors in estimating objective function coefficients. Even if such errors are unbiased, the calculated value of the objective function for the optimal solution will, in an expected value sense, overstate that solution's true performance. This presupposes that errors in the constraint set are relatively unimportant. The existence of such a bias is shown by … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
18
0

Year Published

1996
1996
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(21 citation statements)
references
References 17 publications
2
18
0
Order By: Relevance
“…with mass m, and domain parameters ξ i = {g i , k i , x i } consisting of the gravity acceleration constant, the catapult's spring stiffness, and the catapult's spring pre-extension. 2 This result is consistent with Theorem 2 in [3].…”
Section: Decrease Of the Estimated Optimality Gapsupporting
confidence: 88%
See 2 more Smart Citations
“…with mass m, and domain parameters ξ i = {g i , k i , x i } consisting of the gravity acceleration constant, the catapult's spring stiffness, and the catapult's spring pre-extension. 2 This result is consistent with Theorem 2 in [3].…”
Section: Decrease Of the Estimated Optimality Gapsupporting
confidence: 88%
“…Furthermore, they demonstrated the "optimistic bias" of a nonlinear program, and mentioned the effect of errors on the parameters of linear constraints. The optimization problem introduced in Section 3 belongs to the class of SPs for which the assumption required in [2] are guaranteed to hold. The most common approaches to solve convex SPs are sample average approximation methods, including: (i) the Multiple Replications Procedure and its derivatives [3,20] which assess a solution's quality by comparing with sampled alternative solutions, and (ii) Retrospective Approximation [24,25] which iteratively improved the solution by lowering the error tolerance.…”
Section: Key Publications On the Optimality Gapmentioning
confidence: 99%
See 1 more Smart Citation
“…A similar argument appears in Hobbs and Hepenstal, (1989). 59 Examples include the "winner's curse" phenomenon in auctions, where the highest bidder is the most optimistic and therefore sure to be wrong, and the survivorship bias in the estimation of mutual fund or hedge fund returns, where the failed firms are not counted in the averages.…”
Section: Discussion Of Detailed Production Cost Simulation Resultsmentioning
confidence: 99%
“…It has been noted that uncertainty about the coefficients of the objective function causes optimization to be optimistically biased. This means that the value of the optimal solution will be overestimated if there are random errors in the objective function coefficients (Hobbs and Hepenstal 1989). Errors on the right hand sides of the constraints have the opposite effect (Itami 1974).…”
Section: Introductionmentioning
confidence: 99%