Revision as of 09:26, 22 August 2022 edit Bernanke's Crossbow (talk \| contribs) Extended confirmed users 9,850 edits →Further reading: Added link, b/c Google Scholar has trouble finding it ← Previous edit		Revision as of 10:01, 22 August 2022 edit undo Bernanke's Crossbow (talk \| contribs) Extended confirmed users 9,850 edits →top: AfD: Nominated for deletion; see Wikipedia:Articles for deletion/Ordinal optimization. Next edit →
Line 1: <!-- Please do not remove or change this AfD message until the discussion has been closed. --> {{AfDM\|page=Ordinal optimization (2nd nomination)\|year=2022\|month=August\|day=22\|substed=yes\|origtag=afdx}} <!-- End of AfD message, feel free to edit beyond this point --> 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]].

Ordinal optimization: Difference between revisions