Simple Explanation of the No-Free-Lunch Theorem and Its Implications
Y.C. Ho and
D.L. Pepyne
Additional contact information
Y.C. Ho: Harvard University
D.L. Pepyne: Harvard University
Journal of Optimization Theory and Applications, 2002, vol. 115, issue 3, No 6, 549-570
Abstract:
Abstract The no-free-lunch theorem of optimization (NFLT) is an impossibility theorem telling us that a general-purpose, universal optimization strategy is impossible. The only way one strategy can outperform another is if it is specialized to the structure of the specific problem under consideration. Since optimization is a central human activity, an appreciation of the NFLT and its consequences is essential. In this paper, we present a framework for conceptualizing optimization that leads to a simple but rigorous explanation of the NFLT and its implications.
Keywords: No-free-lunch theorem; optimization; learning; decision making; search; strategy selection; impossibility theorem; representation and encoding; robustness; sensitivity; complexity (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (22)
Downloads: (external link)
http://link.springer.com/10.1023/A:1021251113462 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
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:joptap:v:115:y:2002:i:3:d:10.1023_a:1021251113462
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1023/A:1021251113462
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).