Options
2000
Conference Paper
Titel
Some Technical Remarks on the Proof of the "No Free Lunch" Theorem
Abstract
The technical issues of the proof of the 'no free lunch' (NFL) theorem are discussed. The NFL theorem claims that each optimization algorithm performs equal in average. In one step of the proof, the assertion of the NFL theorem is used for obtaining the next intermediate result. It was shown that NFL theorem is not a mathematically provable theorem and in optimization search every result is equally probable.