Busıness Decısıon Models Final 8. Deneme Sınavı
Toplam 20 Soru1.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 |
A constant-sum game is a game of total conflict and the sum of total possible winnings
remains constant no matter what actions the players take. Poker, for example, is a constant-sum game because the player compete for a constant sum of money, though its distribution shifts in the course of play. The decisions of each players do not affect
the available winningsç.
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 |
8 x1 + 2 x2 ≤ 128 : bounded . pg. 99 . Correct answer is E.
3.Soru
Who developed the game theory extensively in the 1950s?
Emil Borel |
John von Neumann |
Oskar Morgenstern |
John Nash |
Albert Einstein |
The game theory was developed extensively by John Nash in the 1950s.
4.Soru
- 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?
I and II only |
I, III, and V |
I, II, and V |
II, III, and IV |
III and IV only |
There are various methods for selecting an arbitrary variable; the most prominent ones are:
- Northwest corner method
- Least-cost method
- Vogel’s approximation method
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 |
Battle of the Sexes is a two-person game in the game theory. In this game, a couple Mark and Kelly wish to go out together, but they have different preferences. Mark prefers to go to the football match while Kelly wants to go to the opera. In this game both players wish to coordinate their behavior, but they have conflict interests. That is, there are two steady states: one in which Mark and Kelly always choose football match and one in which they always choose opera.
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 |
The probabilities of going from one state to another are called 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 |
In stochastic processes, events occur over time, and time can be dealt with either in discrete fashion or continuous fashion.
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 |
The concept of linear programming and its solution method “simplex” was first introduced by George Dantzig, the so-called father of linear programming. His research on the planning methods for the US Army Air Force was a game changer, as the method had great potential for dealing with difficult decision making problems by utilizing technological/computational advances.
The correct answer is E.
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 |
-3 x1 + 4 x2 ≥ 64 : unbounded. pg. 99 . Correct answer is D.
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 |
In a linear program, the optimum solution is at one of the corners of the feasible region, i.e., the solution space.
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 |
If the state space S of a stochastic process is discrete, the process is called discrete-state process often referred as a chain.
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 |
The initial basic feasible solution obtained in the table below has the basic variables given below.
x11 = 10, x21 = 1, x22 = 3, x32 = 4, x42 = 4, x43 = 5,
The objective value for this solution, which is the total transportation cost is 168 TL.
Z = 5× 10 + 1 × 7 + 3 × 5 + 4× 6+ 4 × 6+ 5 × 6 = 168 TL.
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 |
x3 : it has the maximum positive coefficient. pg. 95. Correct answer is C
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 |
Identity matrix of n is the n×n square matrix with ones on the main diagonal and zeros elsewhere. An identity matrix is also called a unity 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 |
lowest in rows : -5 -4 -6 ; max : -4 . pg. 151. Correct answer is C.
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 |
The variables that are set to zero are called non-basic variables. These have zero coefficients and are not related to the basic solution, as they have no effect on the objective function. On the contrary, the remaining are the only variables that determine the basic solution.
The correct answer is E.
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. |
the dual problems are imaginary and thus, purchasing is not a real option for the Factory. The purchasing price concept in the text is sometimes called shadow price so as to stress the virtuality. The real alternative for this factory is “not to produce”, no purchasing.
18.Soru
Who found the simplex method?
Adam Smith |
Dale Carnegie |
George Dantzig |
Otto von Bismarck |
Edmund Burke |
The concept of linear programming and its solution method “simplex” was first introduced by George Dantzig.
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 |
A random variable maps the set of all possible outcomes in an experiment into the real numbers, R. Due to this feature of it, a random variable is a function.
20.Soru
What is the pivot number in the tableau above?
-2 |
-5 |
-6 |
1 |
2 |
The pivot number in the tableau below is 2:
-
- 1.SORU ÇÖZÜLMEDİ
- 2.SORU ÇÖZÜLMEDİ
- 3.SORU ÇÖZÜLMEDİ
- 4.SORU ÇÖZÜLMEDİ
- 5.SORU ÇÖZÜLMEDİ
- 6.SORU ÇÖZÜLMEDİ
- 7.SORU ÇÖZÜLMEDİ
- 8.SORU ÇÖZÜLMEDİ
- 9.SORU ÇÖZÜLMEDİ
- 10.SORU ÇÖZÜLMEDİ
- 11.SORU ÇÖZÜLMEDİ
- 12.SORU ÇÖZÜLMEDİ
- 13.SORU ÇÖZÜLMEDİ
- 14.SORU ÇÖZÜLMEDİ
- 15.SORU ÇÖZÜLMEDİ
- 16.SORU ÇÖZÜLMEDİ
- 17.SORU ÇÖZÜLMEDİ
- 18.SORU ÇÖZÜLMEDİ
- 19.SORU ÇÖZÜLMEDİ
- 20.SORU ÇÖZÜLMEDİ