Busıness Decısıon Models

Yanıt Açıklaması: 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ç.

Yanıt Açıklaması: 8 x 1 + 2 x 2 ≤ 128 : bounded . pg. 99 . Correct answer is E.

Yanıt Açıklaması: The game theory was developed extensively by John Nash in the 1950s.

Yanıt Açıklaması: There are various methods for selecting an arbitrary variable; the most prominent ones are: Northwest corner method Least-cost method Vogel’s approximation method

Yanıt Açıklaması: 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.

Yanıt Açıklaması: The probabilities of going from one state to another are called t ransition probabilities .

Yanıt Açıklaması: In stochastic processes , events occur over time, and time can be dealt with either in discrete fashion or continuous fashion.

Yanıt Açıklaması: 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.

Yanıt Açıklaması: -3 x 1 + 4 x 2 ≥ 64 : unbounded . pg. 99 . Correct answer is D.

Yanıt Açıklaması: In a linear program, the optimum solution is at one of the corners of the feasible region, i.e., the solution space.

Yanıt Açıklaması: If the state space S of a stochastic process is discrete, the process is called discrete-state process often referred as a chain .

Yanıt Açıklaması: The initial basic feasible solution obtained in the table below has the basic variables given below. x 11 = 10, x 21 = 1, x 22 = 3, x 32 = 4, x 42 = 4, x 43 = 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.

Yanıt Açıklaması: x 3 : it has the maximum positive coefficient. pg. 95. Correct answer is C

Yanıt Açıklaması: 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.

Yanıt Açıklaması: lowest in rows : -5 -4 -6 ; max : -4 . pg. 151. Correct answer is C.

Yanıt Açıklaması: 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.

Yanıt Açıklaması: 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.

Yanıt Açıklaması: The concept of linear programming and its solution method “simplex” was first introduced by George Dantzig.

Yanıt Açıklaması: 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.

Yanıt Açıklaması: The pivot number in the tableau below is 2: