Busıness Decısıon Models Çıkmış Sorular, Online Deneme Sınavları, Çalışma, Dersler, Sınava Hazırlanma, vize, final

Soru 1:

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

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

Soru 2:

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

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

Soru 3:

⌈ 3 -2 -4⌉ |-5 -4 4| |2 0 5| ⌊ -3 -2 -4 ⌋ What is the maximin strategy for Player I in this game ?

A) -4 B) 4 C) 0 D) 5 E) -5

Soru 4:

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

A) Northwest corner method B) Least-cost method C) Vogel’s approximation method D) Russel’s approximation method E) Hungarian method

Soru 5:

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

A) Strategy B) Players C) Pay-off D) Pay-off Matrix E) Saddle Point

Soru 6:

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

A) Aperiodic state B) Periodic state C) Recurrent state D) Transient state E) Accessible state

Soru 7:

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

A) 18 B) 20 C) 24 D) 30 E) 35

Soru 8:

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

A) The difference is that the constraints of the transportation model are in the form of equality. Thus, the duality relation here is asymmetric. B) For the problem of the production decision, a counterpart actor was assumed as if it provided a purchasing alternative. C) The original problem is to select the most economical distribution routes that meet the demands of the destinations. D) Total cost of the shipment depends on total costs of transportation for the selected routes. E) Dual transportation model is a transportation model, where the supply and demand constraints are equality, and the total supply equals total demand.

Soru 9:

Min 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) x2 B) s2 C) x1 D) s1 E) x3

Soru 10:

_______ is the most convenient method to initialize the solution of a transportation model. Which of the following completes the sentence above best?

A) Northwest Corner Method B) Dual Model C) Modified Distribution Method D) Vogel's Approximation Method E) Least-Cost Method

Soru 11:

The dual of a balanced transportation problem is interpreted as a problem of ____________. Which of the following completes the defintion given above?

A) a counterpart who provides an alternative to transportation. B) the total cost of each route. C) linear optimization D) minimizing the total transportation cost. E) feasibility of the transportation.

Soru 12:

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?

A) 1. Balanced transportation method2. Least-cost method3. Vogel’s approximation method B) 1. Northwest corner method2. Duality properties method3. Vogel’s approximation method C) 1. Northwest corner method2. Least-cost method3. Vogel’s approximation method D) 1. Northwest corner method2. Least-cost method3. Complementary solutions method E) 1. Northwest corner method2. Duality properties method3. Complementary solutions method

Soru 13:

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

A) 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. B) Unlike the Northwest Method, the Leastcost algorithm begins with selecting the route that has the smallest unit cost of transportation. C) If there is more than one variable that has the smallest cost, any variable among these can be selected arbitrarily. D) The value allocated to this variable is the value of the smaller one of the supply and demand. E) The value allocated to the selected route is the greater one of the values of the supply and demand.

Soru 14:

Which model do the steps given below belong to ?

A) Northwest- Corner Method B) Balanced Transportation Model C) Modified Distribution Model D) The Hungarian Method E) Least-Cost Method

Soru 15:

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

A) %50 B) %87 C) %13 D) %17 E) %83

Soru 16:

Identify the corners (corner point feasible solution) of the feasible region, of which one is expected to be the optimum. Use iso-profit (iso-cost) lines based on the maximum (minimum) objective function to determine the optimum corner point feasible solution. Represent the problem with a system of equations, which has m equations and n non-negative variables. Determine the basic feasible solutions of the equations, of which one is expected to be the optimum. 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?

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

Soru 17:

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

A) Decision Analysis B) Discrete-state process C) Brand Switching D) Markov analysis E) Stochastic process

Soru 18:

Who proposed the game theory for the first time?

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

Soru 19:

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?

A) I,II,III B) I,III,II C) II,III,I D) III,I,II E) III,II,I

Soru 20:

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

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