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

Soru 1:

What kind of a game is Poker?

A) A constant-sum game B) A zero-sum game C) A variable-game D) A non-cooperative game E) A symmetric game

Soru 2:

Max Z = 16 x 1 + 4 x 2 is the objective function of the linear program, which has only one constraint other than the non-negativity constraints. Which of the constraints below ensures that the program has an optimal solution ?

A) x1+ x2≥ 512 B) - x1– 5 x2≤ -1024 C) 2 x1≥ -3 x2 D) -6 x1+ 7 x2≤ 0 E) 8 x1+ 2 x2≤ 128

Soru 3:

Who developed the game theory extensively in the 1950s?

A) Emil Borel B) John von Neumann C) Oskar Morgenstern D) John Nash E) Albert Einstein

Soru 4:

Least-cost method Northwest corner method The Modified Distribution Method The Hungarian Method Vogel’s approximation method Considering the items above, which is the correct for the lists of Initialization Methods?

A) I and II only B) I, III, and V C) I, II, and V D) II, III, and IV E) III and IV only

Soru 5:

In which game, a couple Mark and Kelly wish to go out together, but they have different preferences?

A) Matching Coins B) Battle of the Sexes C) Hawk-Dove D) Rock, Paper, Scissors E) The Prisoner’s Dilemma

Soru 6:

What are the probabilities of going from one state to another are called?

A) Matrix multiplication B) Probability matrix C) Transition diagram D) Finite number states E) Transition probabilities

Soru 7:

Which term completes the blank in the following sentence best? In ........................, events occur over time, and time can be dealt with either in discrete fashion or continuous fashion.

A) Decision Analysis B) Markov chains C) Stochastic processes D) Markov analysis E) Continuous-parameter process

Soru 8:

Who first introduced concept of linear programming and its solution method “simplex”?

A) Fraser Sherman B) Leonid V. Kantorovic C) William W. Cooper D) Tjalling C. Koopmans E) George Dantzig

Soru 9:

Max Z = 2 x 1 + 8 x 2 is the objective function of the linear program, which has only one constraint other than the non-negativity constraints. Which of the constraints below ensures that the program does not have an optimal solution ?

A) x1+ x2≤ 256 B) - x1– 5 x2≥ -128 C) 2 x1≤ -3 x2 D) -3 x1+ 4 x2≥ 64 E) x1+ 2 x2≤ 0

Soru 10:

Where is the optimum solution located in a linear programme?

A) at left corner of the feasible region B) at right corner of the feasible region C) at one of the corners of the feasible region D) at top corner of the feasible region E) at bottom corner of the feasible region

Soru 11:

Which term completes the blank in the following sentence best? If the state space S of a stochastic process is discrete, the process is called discrete-state process often referred as a ................

A) Brand Switching B) Random variable C) Stochastic process D) Chain E) Parameter set

Soru 12:

For the given cost matrix, how much is the total transportation cost calculated by Northwest Corner Method solution? (all costs in Turkish liras)

A) 157 B) 159 C) 145 D) 168 E) 175

Soru 13:

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

A) x1 B) x2 C) x3 D) s1 E) s2

Soru 14:

What is the term used to describe the n×n square matrix with ones on the main diagonal and zeros elsewhere?

A) Pay-off matrix B) Null matrix C) Identity matrix D) Decision matrix E) Rectengular matrix

Soru 15:

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

A) -5 B) -6 C) -4 D) -1 E) -2

Soru 16:

Which of the following explains the non-basic variables?

A) The variables that are greater than 1 B) The variables that are less than zero C) The variables that are set to 1 D) The variables that are greater than zero E) The variables that are set to zero

Soru 17:

Why are purchasing is not a real option for the Factory in dual problems?

A) because the factory already did it. B) because the factory cannot afford it. C) because the dual problems are imaginary. D) because the dual problems does not include money. E) because the goods are semi-finished.

Soru 18:

Who found the simplex method?

A) Adam Smith B) Dale Carnegie C) George Dantzig D) Otto von Bismarck E) Edmund Burke

Soru 19:

Why is the random variable identified as a function?

A) It concerns sequences of events ruled by probability laws. B) It is defined on a given probability space. C) It maps the set of all possible outcomes in an experiment into the real numbers. D) It describes the behavior of a system operating over some period of times. E) It has a special property that probabilities indicating how the process will evolvein the future.

Soru 20:

What is the pivot number in the tableau above?

A) -2 B) -5 C) -6 D) 1 E) 2