aof.sorular.net
Busıness Decısıon Models
Busıness Decısıon Models Deneme Sınavı
Busıness Decısıon Models Deneme Sınavı Sorusu #1368889
Busıness Decısıon Models Deneme Sınavı Sorusu #1368889
The simplex algorithm iteratively switches to the next ------- solution that is adjacent to the previous -------- solution until it reaches the optimum Z.
Which of the followings is complete the gaps in the sentence above?
|
Basic feasible |
|
Bayesian rule |
|
Corner point feasible |
|
Decision tree |
|
Complex feasible |
Yanıt Açıklaması:
The simplex algorithm iteratively switches to the next basic feasible solution that is adjacent to the previous basic feasible solution until it reaches the optimum Z.
Yorumlar
- 0 Yorum