Final Sınavı - Busıness Decısıon Models

Soru 1:

? 2 4 5 0? |0 1 -1 3| ? 2 6 7 1 ? What is the upper value of this matrix game ?

A) 2 B) 6 C) 7 D) 3 E) 5

Soru 2:

Which of the followings are crucial elements for a stochastic processes? Markov chain Discrete time Continous time Probability Arithmetic events

A) I-II-III-IV B) I-II-IV-V C) I-III-IV-V D) II-III-IV-V E) I-II-III-IV-V

Soru 3:

Which one below is something that a ration player never use?

A) Pure strategy B) Saddle point C) Mixxed strategy D) Dominated strategy E) Pay-off

Soru 4:

? -1 -2? |-6 -3| ? -4 1 ? What is the sum of the lower and the upper values of this matrix game ?

A) -10 B) 0 C) -5 D) -3 E) -9

Soru 5:

Min Z = x 1 + 3 x 2 + 2 x 3 + 5 x 4 + 4 x 5 is the objective function of a linear program. The initial basic feasible solution for this program is (0, 0, 0, 0, 0). Which of the following is the 1st variable that enters to basic variables ?

A) x2 B) x4 C) x1 D) x5 E) x3

Soru 6:

When does a transition matrix is called regular?

A) When there is % 50 probability. B) If some power of the matrix includes all negative entries. C) If some power of the matrix includes all positive entries. D) When zeros occur in the identical places. E) When the probability is %100 percent.

Soru 7:

The solution of a transportation model follows three steps to reach the optimum. Which of the options include these three steps in the correct order?

A) Determining a basis / Checking the optimality of the solution / Iterating to a new basic feasible solution if needed B) Checking the optimality of the solution /Determining a basis / Iterating to a new basic feasible solution if needed C) Checking the optimality of the solution / Introducing the initial basic feasible solution / Iterating to a new basic feasible solution if needed D) Introducing the initial basic feasible solution / Iterating to a new basic feasible solution if needed / Checking the optimality of the solution. E) Introducing the initial basic feasible solution / Checking the optimality of the solution / Iterating to a new basic feasible solution if needed.

Soru 8:

Which of the following can not be one of the steps of Hungarian Method?

A) Identify the smallest value of each row for the cost matrix of the assignment problem. Subtract each row’s smallest value from all the costs in the respective row. B) Identify the smallest value of each column for this altered matrix. Subtract each column’s smallest value from all the costs in the respective column C) Mask the columns and rows out that have a zero value. The number of masked out rows and columns must be at a maximum. D) If the number of masked out rows and columns is equal to n, then the optimum can be obtained from the present matrix; move on to the next step. If not, skip to Step 6. E) Identify the optimal solution by the coordinates of the zero-valued elements in the present matrix.

Soru 9:

Four workers will be assigned to five machines in a manufacturing plant. The labor costs of the workers on the machines are given in TL below. In the solution of the above assignment problem carried out with the Hungarian Algorithm, and the following table was reached in the last step. What is the objective value of the optimum solution for this problem?

A) 100 B) 110 C) 150 D) 170 E) 430

Soru 10:

When given a one-step transition matrix of a process, if the matrix is multiplied by 3 times with itself, what the result shows?

A) Three-step transition matrix of the process B) Four-step transition matrix of the process C) Nine-step transition matrix of the process D) Same transition matrix of the process E) Initial transition matrix of the process

Soru 11:

Which property of dual model refers that the objective value of Z and the objective value of W are equal only if the basic feasible solution is the optimal for the primal as well as the dual model?

A) Maximum duality property B) Minimum duality property C) Weak duality property D) Strong duality property E) Complementary solutions property

Soru 12:

Which one of the following is true for an assignment model?

A) The value of the decision variables must be non-negative B) The value of the decision variables are greater than 1 C) The number of the origins is equal to the destinations D) Cannot be solved by the simplex algorithm E) The objective function is a maximization

Soru 13:

I.There should be at least one player II.Each player’s chosen strategies determine the outcome of the game III.Each player acts rationally to maximize his/her gains Which one/ones above is/are correct about games?

A) Only I B) I-II C) I-III D) II-III E) I-II-III

Soru 14:

According to the matrix, which of the following is the recurrent?

A) a, d B) b, c C) b, d D) a, b E) c, d

Soru 15:

Which of the following is not true for the method of Minimax Regret?

A) This method is based on opportunity loss B) This method proposed that maximum regret be minimized by choosing the best pay off for each event. C) This method allows the decision maker to use these two approaches together. There is a coefficient indicating the level of optimism of the decision maker. This coefficient is symbolized by alpha (α). D) The regret of each event for each alternative is calculated and regret matrix or opportunity loss table is created. This table shows the losses to be incurred if the alternative is not selected for the best outcomes of each event. E) In this method, regardless of the objective function, the smallest value is always selected from the regret matrix.

Soru 16:

In which game two players show simultaneously either one finger or two fingers?

A) The Prisoner’s Dilemma B) Matching Coins C) Hawk-Dove D) The Odds and Evens E) Rock, Paper, Scissors

Soru 17:

If two corner-point feasible solutions are connected by a line segment, these corner-point feasible solutions are ______. Which of the following completes the statement above?

A) equal B) adjacent C) slack variables D) surplus E) optimal

Soru 18:

_____ allows checking for the optimality of the primal solution by inspecting the feasibility of its dual solution. Which of the following best fills the blank above?

A) Strong duality property B) The dual model C) balanced transportation model D) complementary solutions property E) weak duality property

Soru 19:

States of Nature S1(0.3) S2(0.5) S3(0.2) A1 50 110 30 A2 100 60 50 A3 70 90 60 What is the maximum Expected Opportunity Loss of the TL gain strategy table above ?

A) 27 B) 23 C) 21 D) 25 E) 19

Soru 20:

Which term is described by “unconditional decision always to select a particular course of action”?

A) Pay-off B) Saddle point C) Pure strategy D) Mixed strategy E) Pay-off Matrix