Ordinal optimization: Difference between revisions

Revision as of 09:23, 22 August 2022

Revision as of 09:23, 22 August 2022

Line 1:

{{Proposed deletion/dated

|concern = Entire article appears to be based on a misunderstanding. The only source explicitly mentioning "ordinal optimization" is Ho, Srinivas, and Vakili, which introduces it as a variant [[approximation algorithm]]. But I don't think there's any content here worth merging into that article.

|timestamp = 20220822092255

|nom = Bernanke's Crossbow

|help =

}}

In [[mathematical optimization]], '''ordinal optimization''' is the maximization of functions taking values in a [[partially ordered set]] ("poset").{{sfn|Dietrich|Hoffman|2003}}{{sfn|Topkis|1998}}{{sfn|Singer|1997}}{{sfn|Björner|Ziegler|1992}} Ordinal optimization has applications in the theory of [[queuing theory|queuing]] [[flow network|networks]].