Busıness Decısıon Models (ENG)
Ünite Sınavı Soruları
- 20 soru
- Soru metinleri açık; şıklar ve cevap anahtarı uygulamada
- 1
Two corner-point feasible solutions are adjacent if:
- 2
Max Z = 16 x1 + 4 x2 is the objective function of the linear program, which has only one constraint other than the non-negativity constraints. Which of the constraints below ensures that the program has an optimal solution ?
- 3
A ------ variable represents the remainder of an expendable resource and applies to less than or equal constraints. On the other hand, a ------- represents the excess amount of a restricted resource and applies to greater than or equal constraints.
Which of the followings are complete the gaps, in the sentence above, with the correct order?
- 4
I. The method solely focuses on CPF solutions, i.e., BF solutions.
II The selection between the adjacent BF solutions is based on the improvement in Z.
III The preferred initial BF solution is the CPF solution at the origin, where all decision variables areset to zero.
IV Optimality test subject changes from a BF solution to an adjacent one.
Which one or ones are true about simplex method?
- 5
What are the variables that are set to zero called?
- 6
Which of the following is true regarding artificial variables?
- 7
In the chart above which points are not feasible?
- 8If the solution space is presented by m linear equations and n variables, the corner points of system of equations are obtained by:
- 9
What is the corner point of the solution space?
- 10Which of the following is false regarding simplex method?
- 11
Which of the following variables represents the remainder of an expendable resource and applies to less than or equal constraints?
- 12If the objective function of a linear program is "Minimize Z = 3x + 12y + 3", this is equivalent to:
- 13
A corner point of the solution space in linear programs is called:
- 14Which of the following does a slack variable represent?
- 15
Min Z = x1 + 3 x2 + 2 x3 + 5 x4 + 4 x5 is the objective function of a linear program. The initial basic feasible solution for this program is (0, 0, 0, 0, 0). Which of the following is the 1st variable that enters to basic variables ?
- 16
What is the pivot number in the tableau above?
- 171. Iteration 2. Test for optimality 3. Inıtialization If there isn't a better CPF solution in a simplex method which steps are taken respectively?
- 18
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 ?
- 19
In the simplex algorithm, what should we do if the basic feasible solution is optimal?
- 20
Max Z = x1 – 3 x2 + 2 x3 + 0 s1 + 0 s2 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 ?