Busıness Decısıon Models Final 8. Deneme Sınavı

Toplam 20 Soru
PAYLAŞ:

1.Soru

What kind of a game is Poker?


A constant-sum game

A zero-sum game

A variable-game

A non-cooperative game

A symmetric game


2.Soru

Max Z = 16 x1 + 4 x2 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 ?


x1 + x2 ≥ 512

- x1 – 5 x2 ≤ -1024

2 x1 ≥ -3 x2

-6 x1 + 7 x2 ≤ 0

8 x1 + 2 x2 ≤ 128


3.Soru

Who developed the game theory extensively in the 1950s?


Emil Borel

John von Neumann 

Oskar Morgenstern

John Nash

Albert Einstein


4.Soru

  1. Least-cost method
  2. Northwest corner method
  3. The Modified Distribution Method
  4. The Hungarian Method
  5. Vogel’s approximation method

Considering the items above, which is the correct for the lists of Initialization Methods?


I and II only

I, III, and V

I, II, and V

II, III, and IV

III and IV only


5.Soru

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


Matching Coins

Battle of the Sexes

Hawk-Dove

Rock, Paper, Scissors

The Prisoner’s Dilemma


6.Soru

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


Matrix multiplication

Probability matrix

Transition diagram

Finite number states

Transition probabilities


7.Soru

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.


Decision Analysis

Markov chains

Stochastic processes

Markov analysis

Continuous-parameter process


8.Soru

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


Fraser Sherman

Leonid V. Kantorovic

William W. Cooper

Tjalling C. Koopmans

George Dantzig


9.Soru

Max Z = 2 x1 + 8 x2 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 ?


x1 + x2 ≤ 256

- x1 – 5 x2 ≥ -128

2 x1 ≤ -3 x2

-3 x1 + 4 x2 ≥ 64

x1 + 2 x2 ≤ 0


10.Soru

Where is the optimum solution located in a linear programme?


at left corner of the feasible region 

at right corner of the feasible region 

at one of the corners of the feasible region 

at top corner of the feasible region 

at bottom corner of the feasible region


11.Soru

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 ................


Brand Switching

Random variable

Stochastic process

Chain

Parameter set


12.Soru

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


157

159

145

168

175


13.Soru

Max Z = x1 – 3 x2 + 2 x3 + 0 s1 + 0 s2 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 ?


x1

x2

x3

s1

s2


14.Soru

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


Pay-off matrix

Null matrix

Identity matrix

Decision matrix

Rectengular matrix


15.Soru

?-3 -5 -2 4 6?

|-2   3  0 1 -4|

?-1 4 -6 2 -2?

What is the lower value of this matrix game ?


-5

-6

-4

-1

-2


16.Soru

Which of the following explains the non-basic variables?


The variables that are greater than 1

The variables that are less than zero 

The variables that are set to 1

The variables that are greater than zero

The variables that are set to zero


17.Soru

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


because the factory already did it. 

because the factory cannot afford it. 

because the dual problems are imaginary.

because the dual problems does not include money.

because the goods are semi-finished. 


18.Soru

Who found the simplex method?


Adam Smith 

Dale Carnegie

George Dantzig

Otto von Bismarck

Edmund Burke


19.Soru

Why is the random variable identified as a function?


It concerns sequences of events ruled by probability laws.

It is defined on a given probability space.

It maps the set of all possible outcomes in an experiment into the real numbers.

It describes the behavior of a system operating over some period of times.

It  has a special property that probabilities indicating how the process will evolve
in the future.


20.Soru

question 9

What is the pivot number in the tableau above?


-2

-5

-6

1

2