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

Soru 1:

What are the variables that are set to zero called?

A) confounding variables B) non-basic solution C) basic solution D) basic variables E) non-basic variables

Soru 2:

When does a Markov chain is considered as irreducible?

A) If a Markov chain has more than one class. B) If the state space S is a single communicating class. C) If each state is accessible from the other. D) If each state is certain to be visited again. E) If there are direct transitions between states.

Soru 3:

What is the pivot number in the tableau above?

A) -13 B) -6 C) 2 D) 4 E) 6

Soru 4:

A system has 4 equations and 7 variables. For this system of equations, how many non-basic variable(s) are required to determine the basic solutions ?

A) 0 B) 11 C) 7 D) 4 E) 3

Soru 5:

Which of the following option is the description of the "weak duality property"?

A) the objective value of Z and the objective value of W are equal only if the basic feasible solution is the optimal for the primal as well as the dual model. B) A feasible solution of the primal solution (x) is not optimal if the dual solution (y) violates a constraint of the dual model. The simplex method concurrently identifies basic feasible solutions for a primal model and its dual. C) Eliminates the computations required by the simplex method and eases off finding the dual solution D) When the primal-dual pairs’ objective values are equal, the solutions are optimal if the solutions are both feasible—neither of the solutions does violate their respective constraints. E) The objective value, Z is equal or greater than W, the objective value of the corresponding dual solution.

Soru 6:

What is the value at the intersection of the pivotal column and row?

A) Non-basic variable B) Basic feasible solutions C) Corner-point feasible D) Pivotal number E) Iteration

Soru 7:

Which of the followings are Markov property? Interested in future Dependent of last two states Independent of past Consider the present From beginning to last, spesify all chain

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

Soru 8:

? 1 -5? |-2 3| |-3 1| ? -4 0? For Player I of the game above, which of the following is the expected pay-off of choosing 3rd row ?

A) -3 p + 1 B) -4 p + 1 C) -3 + p D) -4 + p E) -3 p

Soru 9:

" All players have the same actions and even in case of interchanging players, the actions of players remain the same." Which notion below is explained in the definition?

A) One-person game B) Two-person games C) N- person game D) Symmetric games E) Asymmetric games

Soru 10:

_____ interchanges costs and constraints of the primal model, and converts the objective from maximization to minimization. Which of the following best fills the blank above?

A) The dual model B) A linear program C) Cost and constraint coefficients D) Primal model E) Modified distribution model

Soru 11:

What can be calculated with the equation above?

A) Number of basic solutions B) Number of variables C) The corner points of system of equations D) Number of slack variables E) Number of non-basic solutions

Soru 12:

Which of the following does a slack variable represent?

A) The remainder of an expendable resource B) The excess amount of a restricted resource C) Functional constraints D) Equation format E) Greater than or equal constraint

Soru 13:

What is the corner point of the solution space?

A) Pivotal number B) Iteration C) Corner-point feasible D) A basic solution E) Non-basic variables

Soru 14:

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 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 Determine a basic feasible solution to initiate The solution of a transportation model follows the steps that the simplex method offers. In this context, which of the following is true for the correct sequence of these steps?

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

Soru 15:

A system has 4 equations and 7 variables. For this system of equations, how many basic solutions are there ?

A) 35 B) 28 C) 7 D) 11 E) 14

Soru 16:

When does a degenerate basic variable act as a non-basic variable?

A) In complementary solutions property B) In a degenerate basic feasible solution C) In Northwest corner method D) In Least-cost method E) In Vogel’s approximation method

Soru 17:

"The assignment model has a tailored solution method such as the transportation model does. The solution method of the assignment model is called the___________." Fill in the blank with correct concept.

A) Modified Distribution Method B) Hungarian Method C) Vogel’s Approximation Method D) Least-cost Method E) Northwest Corner Method

Soru 18:

⌈ -3 0 -4 -4 -5⌉ ⌊ -1 1 -2 2 -6 ⌋ What is the minimax strategy of Player II in this matrix game ?

A) -6 B) -1 C) 1 D) 2 E) -5

Soru 19:

The Hungarian method consists of six basic steps. Which is the first step to be followed?

A) Identify the optimal solution by the coordinates of the zero-valued elements in the present matrix. B) Mask the columns and rows out that have a zero value. The number of masked out rows and columns must be at a minimum. C) 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. D) 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. E) 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

Soru 20:

According to the matrix, 'a' represents the weight gaining probability of a person trying to control his / her weight and 'b' represents the weight losing probability of the person. In the long run, what is the steady-state behavior of the person's weight?

A) gain %56, lose %44 B) gain %50, lose %50 C) gain %44, lose %56 D) gain %66, lose %34 E) gain %34, lose %66