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

Soru 1:

For this system of equations, how can basic solutions be determined?

A) by setting two of the variables to -1 and solving the equations for the remaining two B) by setting only one of the variables to zero and solving the equations for the remaining one C) by setting two of the variables to zero and solving the equations for the remaining two D) by setting two of the variables to 1 and solving the equations for the remaining two E) by setting two of the variables to 2 and solving the equations for the remaining two

Soru 2:

The simplex algorithm iteratively switches to the next ------- solution that is adjacent to the previous -------- solution until it reaches the optimum Z. Which of the followings is complete the gaps in the sentence above?

A) Basic feasible B) Bayesian rule C) Corner point feasible D) Decision tree E) Complex feasible

Soru 3:

What is a state called if it can only return to itself after a fixed number of transitions greater than 1?

A) Reducible B) Irreducible C) Absorbing D) Periodic E) Aperiodic

Soru 4:

If two corner-point feasible solutions are connected by a line segment, what are they called?

A) compound B) adjacent C) non-basic solution D) basic solution E) basi feasible solution

Soru 5:

⌈ 11 5 9⌉ ⌊ 15 7 10 ⌋ What is the equilibrium pair of this matrix game ?

A) {2nd row, 2nd column} B) {1st row, 3rd column} C) {2nd row, 1st column} D) {1st row, 1st column} E) {2nd row, 3rd column}

Soru 6:

In which state does Markov chain lock itself once it is in it?

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

Soru 7:

Identify the optimal solution by the coordinates of the zero-valued elements in the present matrix. If the number of masked out rows and columns is equal to n, then the optimum can be obtained from the present matrix; move on to the next step. If not, skip to Step 6. Identify the smallest value of each row for the cost matrix of the assignment problem. Subtract each row’s smallest value from all the costs in the respective row. Identify the smallest value except for the ones in masked out rows and columns. This value is then subtracted from the values of unmasked rows and columns and, added to the intersections of masked out rows and columns. Return to Step 3. Identify the smallest value of each column for this altered matrix. Subtract each column’s smallest value from all the costs in the respective column. Mask the columns and rows out that have a zero value. The number of masked out rows and columns must be at a minimum. Considering the items above, which of the followings does include the right phases of the Hungarian Method?

A) I-II-III-IV-V-VI B) I-III-IV-II-V-VI C) II-I-VI-III-IV-V D) III-V-VI-II-I-IV E) V-II-III-VI-IV-I

Soru 8:

Which term completes the blank in the following sentence best? The ..................... p ij(n) is the probability that a process in state j will be in state i after n additional transitions.

A) n-step transition probability B) Sum of probabilities C) Matrix multiplication D) Transition probability matrix E) Stochastic process

Soru 9:

In transportation models, the total supply equals the total demand. Some transportation problems may be less restrictive; the total supply may exceed aggregate demand. In such a case, what should it be done for balancing of the model?

A) A dummy destination must be defined. B) One of the destination which has the highest cost must be removed. C) The nearest solution should be accepted. D) The solution must be obtained instinctively. E) One of the destination which has the lowest cost must be removed.

Soru 10:

Which step below is not for solving m×2 games?

A) Draw two vertical axes one unit apart. These two lines are 0 and 1. B) Take the probabilities of the two alternatives of the column player as q and (1-q), then expected pay-offs of row player for each strategy are expressed with equations. C) Draw n straight lines for j=1, 2… n and determine the lowest point of the upper envelope obtained. This will be the minimax point. D) Draw n straight lines for j=1, 2… n and determine the highest point of the lower envelope obtained. This will be the maximin point. E) The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix.

Soru 11:

In the simplex algorithm, what should we do if the basic feasible solution is optimal?

A) We should reform the mathematical model. B) We should converse the equations to the proper form for checking for the optimality. C) If the solution is optimal, then we stop the process. D) We should choose the leaving variable. E) We should choose the entering variable.

Soru 12:

If the value of a game is zero what is it called as?

A) Saddle point B) Fair game C) Unfair game D) Pay-off E) Pay-off Matrix

Soru 13:

Some of the most important applications of Markov chains involve an important class of Markov chains which is called an absorbing chain. A state i of a Markov chain is called an absorbing state if, once the Markov chain enters the state, it locks in there forever. According to the matrix, which of the state is an absorbing state?

A) I B) II C) III D) IV E) V

Soru 14:

Which one below can not be given as an example for stochastic processes?

A) Radar measurements for the position of an airplane B) Daily prices of a stock or exchange rate fluctuations C) Toss a coin D) Medical data such as a patient’s blood pressure or EKG E) The time of Tv shows

Soru 15:

How can the optimality of a basic feasible solution for the transportation model be tested?

A) by checking the feasibility of basic solution B) by checking the feasibility of the dual solution C) by checking the optimality of the basic solution D) by checking the optimality of the dual solution E) by minimizing the total transportation costs

Soru 16:

List all possible decision alternatives Define decision problem Establish objectives Select the most appropriate decision making method and apply this method Identify the possible outcomes for each decision alternative Determine the best alternative and make your decision Identify the pay-off matrix for each combination of alternatives and events What is the correct order of the steps of decision making process above?

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

Soru 17:

Which method considers the respective costs of the variables so as to find a basic feasible solution that approximates the optimum solution more and begins with selecting the route that has the smallest unit cost of transportation?

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

Soru 18:

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

A) Transition probabilities B) Discrete-state process C) Continuous parameter D) Continuous-state process E) Stochastic process

Soru 19:

A basic solution is a .... of the solution space. Which one is appropriate for the blank ?

A) surface B) curve C) middle point D) corner point E) line

Soru 20:

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

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