o oa ob oc od oe of og oh oi ok ol om on oo op or os ot ou ov ow ox oy oz

Перевод: optimal

[прилагательное]
оптимальный

Тезаурус:

1. If this is so, then the random sequence can evolve into the optimal one in as few as 100 steps, each step being driven by natural selection.
2. Hence, such a solution could not be optimal.
3. If this tableau of LP (w 1 ,, w p ) is optimal ( ) for positive weights, then the BFS is optimal and hence efficient by the results of Section 9.3.
4. Let us now set where refer to the optimal tableau (or any other tableau under consideration).
5. Most significantly, it incorporates a shortest path algorithm which uses the road network to find optimal routes between user-defined start and end nodes.
6. If we were to relax the requirement x i j = 0 or 1 to x i j 0, we would have a TP, but any TP has an optimal solution in integers and, in view of the constraints, this means x i j = 0 or 1.
7. When = 0, T1 is optimal and, when = 1, T2 is optimal.
8. All of the problems considered in this section have had an optimal solution at = 0.
9. To summarise the results, the optimal solution is
10. To illustrate it, we will consider P2 whose optimal tableau is P2/T1.
11. For example, in P4, LP (1, 1, 1) is bounded and the non-objective rows of the optimal tableau are given in the non-objective (first three) rows of P4/T1.
12. Assuming non-degeneracy, at each iteration the cost decreases by a positive amount and so an optimal BFS is eventually reached.
13. We can offer a partial answer to this question by observing that, if we can find w k O satisfying and for j = 2 and 3, then the BFS of P4/T1 is an alternative optimal solution of LP (w 1 , w 2 , w 3 ) and another optimal (efficient) solution can be found by pivoting in column 1 (x 1 -column).