Busıness Decısıon Models

Yanıt Açıklaması: approximate . pg. 89 . Correct answer is B.

Yanıt Açıklaması: Each individual (interested party) is called a player who makes decisions that are interdependent.

Yanıt Açıklaması: A transportation problem is a linear optimization problem, which seeks to minimize the total costs of shipment of items from certain origins to a number of destinations while fulfilling the requirements of destinations and emptying the origins. The decision variables of this problem are the amounts to be shipped for each origin-destination pairs. Some transportation problems may be less restrictive; the total supply may exceed aggregate demand. In such a case, a dummy destination must be defined to fictionally absorb an excessive amount of the supply. Thus, the model becomes balanced and fits the general form of the transportation model. Note that a transportation problem has a feasible solution only if the total availability meets all the requirements. According to these, the correct answer is given in the option C.

Yanıt Açıklaması: (based on the model on page 114) As a linear algebraic property of balanced transportation model, the number of independent equations is m + n – 1. Therefore, a feasible basic solution has m + n – 1 basic variables.

Yanıt Açıklaması: 5 p + 3 (1 – p) = 2 p + 7 (1 – p ) ; 2 p + 3 = -5 p + 7 ; 7 p = 4 ; p = 4 / 7 ; (1 – p) = 3 / 7 . pg. 153. Correct answer is A.

Yanıt Açıklaması: The most common dependence structure is called Markov Property .

Yanıt Açıklaması: Markov analysis differs from decision analysis in that it does not indicate a decision to the decision maker.

Yanıt Açıklaması: A slack or surplus is utilized to reconstruct a constraint to obtain equation format. A slack variable represents the remainder of an expendable resource and applies to less than or equal constraints. On the other hand, a surplus represents the excess amount of a restricted resource and applies to greater than or equal constraints. The correct answer is B.

Yanıt Açıklaması: The answer is the possibility which shows the transition from the snowy-d to sunny-c. The answer is D.

Yanıt Açıklaması: Option A is wrong: The probability of being a rainy day after a snowy day is 0.5 . Option B is wrong: The probability of being a rainy day after a cloudy day is more than the probability of being a sunny day after a rainy day. Option C is wrong: The probability of being a sunny day after a snowy day is less than the probability of being a snowy day after a sunny day. Option D is true: The probability of being a rainy day after a snowy day is more than the probability of being a snowy day after a rainy day. Option E is wrong: The probability of being a cloudy day after a snowy day is 0.3. The answer is D.

Yanıt Açıklaması: Limiting probability and it may converge to steady-state values that are independent of the initial state. The steady-state (or limiting) behavior of a Markov chain means that the chain does not stop changing but that enough time has elapsed, so that the probabilities do not change with respect to time.

Yanıt Açıklaması: equilibrium point = saddle point ; l owest in rows : { 1 3 } ; max = 3 ; greatest in columns : { 3 8 6 } ; min = 3 ; max min : { 2nd row , 1st column } . pg. 152. Correct answer is C.

Yanıt Açıklaması: A pay-off is a numerical value which indicates the amount gained or lost by a player at the end of the game contingent upon the course of actions all of other players.

Yanıt Açıklaması: A state with a self-loop transition is always aperiodic.

Yanıt Açıklaması: The solution of a transportation model follows the steps that the simplex method offers: 1. Determine a basic feasible solution to initiate, 2. 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. 3. Iterate to the next basic feasible solution by determining the entering and leaving variable using the rate of improvement on the objective value. Return to step 2. In this sense, the correct answer is A.

Yanıt Açıklaması: The term “Assignment” refers to the case of job allocations to a group of workers.

Yanıt Açıklaması: All of them are true for simplex method.

Yanıt Açıklaması: The row player must choose 1 of m strategies and the column player must choose 1 of n strategies, simultaneously.

Yanıt Açıklaması: 2 p + 3 (1 – p) = 4 p + 1 (1 – p ) ; -p + 3 = 3 p + 1 ; 4 p = 2 ; p = 1 / 2 ; 2 (1 / 2) + 3 (1 – (1 / 2)) = 1 + (3 / 2) = 5 / 2 . pg. 152. Correct answer is E.

Yanıt Açıklaması: A strategy is a complete description of a player’s course of action during the game.