In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ("poset"). Ordinal optimization has applications in the theory of queuing networks.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| rdfs:seeAlso |