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

Toplam 20 Soru
PAYLAŞ:

1.Soru

Who is the person who is recognized as the first to explore the field of operations research?


William W. Cooper

George B. Dantzig

Tjalling C. Koopmans

Leonid V. Kantorovic

Fraser Sherman


2.Soru

Which term is described by “decision to choose a course of action for each play in accordance with some particular probability”?


Pay-off

Saddle point

Mixed strategy

Pure strategy

Pay-off Matrix


3.Soru

3 -2 -4⌉

|-5 -4  4|

|2   0   5|

-3 -2 -4

What is the maximin strategy for Player I in this game ?


-4

4

0

5

-5


4.Soru

Which of the following is the most convenient method to initialize the solution of a transportation model?


Northwest corner method

Least-cost method

Vogel’s approximation method 

Russel’s approximation method 

Hungarian method


5.Soru

Which notion below can be individuals, organizations,teams or, in some cases, nature?


Strategy

Players

Pay-off

Pay-off Matrix

Saddle Point


6.Soru

"It is a state that can only return to itself after a fixed number of transitions greater than 1." Which notion below belongs to the given description?


Aperiodic state

Periodic state

Recurrent state

Transient state

Accessible state


7.Soru

A system of equations has six variables (n=6) in its three equations (m=3). How many basic solutions does the system have?


18

20

24

30

35


8.Soru

Which of the following can not be said about the Dual of the Transportation Model?


The difference is that the constraints of the transportation model are in the form of equality. Thus, the duality relation here is asymmetric.

For the problem of the production decision, a counterpart actor was assumed as if it provided a purchasing alternative.

The original problem is to select the most economical distribution routes that meet the demands of the destinations.

Total cost of the shipment depends on total costs of transportation for the selected routes.

Dual transportation model is a transportation model, where the supply and demand constraints are equality, and the total supply equals total demand. 


9.Soru

Min 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 ?


x2

s2

x1

s1

x3


10.Soru

_______ is the most convenient method to initialize the solution of a transportation model.

Which of the following completes the sentence above best?


Northwest Corner Method

Dual Model

Modified Distribution Method

Vogel's Approximation Method

Least-Cost Method 


11.Soru

The dual of a balanced transportation problem is interpreted as a problem of  ____________.

Which of the following completes the defintion given above?


a counterpart who provides an alternative to transportation.

the total cost of each route.

linear optimization

minimizing the total transportation cost.

feasibility of the transportation.


12.Soru

Selecting a variable to be basic means allocating the greatest value possible to the respective variable, under the constraints of the total supply and demand for the origins and destinations, respectively. There are various methods for selecting an arbitrary variable. In which of the following, these methods are given correctly?


1. Balanced transportation method
2. Least-cost method
3. Vogel’s approximation method

1. Northwest corner method
2. Duality properties method
3. Vogel’s approximation method

1. Northwest corner method
2. Least-cost method
3. Vogel’s approximation method

1. Northwest corner method
2. Least-cost method
3. Complementary solutions method

1. Northwest corner method
2. Duality properties method
3. Complementary solutions method


13.Soru

Which of the following cannot be said about the Least-cost Method?


The Least-cost method considers the respective costs of the variables so as to find a basic feasible solution that approximates the optimum solution more.

Unlike the Northwest Method, the Leastcost algorithm begins with selecting the route that has the smallest unit cost of transportation.

If there is more than one variable that has the smallest cost, any variable among these can be selected arbitrarily.

The value allocated to this variable is the value of the smaller one of the supply and demand.

The value allocated to the selected route is the greater one of the values of the supply and demand.


14.Soru

Which model do the steps given below belong to ?


Northwest- Corner Method

Balanced Transportation Model

Modified Distribution Model 

The Hungarian Method

Least-Cost Method 


15.Soru

'E0' represents no earthquake during the year in a seismically active zone, and 'E1' represents the at least one-earthquake during the year. The matrix shows the transition between the states through the years respectively. What is the probability in the long run, there will be an earthquake?  


%50

%87

%13

%17

%83


16.Soru

  1. Identify the corners (corner point feasible solution) of the feasible region, of which one is expected to be the optimum.
  2. Use iso-profit (iso-cost) lines based on the maximum (minimum) objective function to determine the optimum corner point feasible solution.
  3. Represent the problem with a system of equations, which has m equations and n non-negative variables.
  4. Determine the basic feasible solutions of the equations, of which one is expected to be the optimum.
  5. Use the objective function to determine the optimum basic feasible solution.

Considering the items above, which of the followings does include the right phases of the algebraic solution?


I and II only

I, II, and III

II and IV only

II, III, and IV

III, IV, and V


17.Soru

Which term completes the blank in the following sentence best?      ............... generally deals with decision making in the face of uncertainty about one future event.


Decision Analysis

Discrete-state process

Brand Switching

Markov analysis

Stochastic process


18.Soru

Who proposed the game theory for the first time?


Emil Borel

John von Neumann

Oskar Morgenstern

John Nash

Albert Einstein


19.Soru

I. Check the optimality of the basic feasible solution as the simplex method does. If it is not, optimal, then move to the next step. If optimal, stop.

II. Iterate to the next basic feasible solution by determining the entering and leaving variable using the rate of improvement on the objective value.

III. Determine a basic feasible solution to initiate.

Which of the following is the correct order of the steps of solution of a transportation model?


I,II,III

I,III,II

II,III,I

III,I,II

III,II,I


20.Soru

According to the above transition diagram, which of the following shows the communication classes of the diagram?


{A, B}

{A, B} and {C, D}

{A, B} and {D, E}

{A, B} and {C, D, E}

{A, B, C, D, E}