If the degeneracy arises in the initial stage, then which of the following is true?
AOne of the basic variables is zero.
BMore than one variable is eligible to leave the basis.
CTie in the ratio of each row, by taking right hand side of each row and dividing by the corresponding element of the key column.
DIterative Cycling of basic solution exists without reaching the optimality.
Initial degeneracy means a basic variable starts at zero (a zero right-hand side); ties in the ratio test cause degeneracy in later iterations.
2.
★ Final term paper (screens, paper 2)
Consider the following simplex table corresponding to the maximization problem: Z: x1 0, x2 0, x3 M+1/2, x4 M, A1 16M-11, A2 0, RHS -0.6M-5.7 | x1: 1, 0, 5, 0, -1, 0, 3 | x2: 0, 1, -5, 0, 3, 0, 9 | A2: 0, 0, -1, -1, -0.6, 1, 0.6. This is the indication that problem has----------.
Ainfeasible Solution
Btemporarily Degenerate Solution
Cunbounded Solution
Ddegenerate Solution
All Z-row entries are non-negative (optimal) but artificial A2 stays in the basis at a positive value 0.6, so the problem is infeasible.
3.
★ Final term paper (screens, paper 2)
In the Simplex table, if the coefficient of non-basic variable says x1 in the z-row is zero, then it indicates that value of z ------------.
Aincrease
Bdecreases
Cdoes not change
Dbecomes infinity
Bringing in a non-basic variable with zero z-row coefficient leaves z unchanged, indicating alternative optima.
No MCQs match this filter.Is filter mein koi MCQ nahi.
No short questions added yet.Abhi koi short sawal shamil nahi.
1.
★ Final term Fall 2004Lecture 264 marks
What are the variants of the simplex method? Write few lines about the followings. (a) Unbounded solution. (b) Unrestricted variables.
Show answerJawab dekhein
Variants (special cases) of the simplex method: degeneracy, alternative (multiple) optima, unbounded solutions, infeasible solutions, and unrestricted (free) variables. (a) Unbounded solution: the objective can improve without limit; detected when the entering variable's column has all entries <= 0, so no ratio exists and no variable can leave. Usually the model is missing a constraint. (b) Unrestricted variables: a variable allowed to be negative, zero or positive. Simplex needs non-negative variables, so replace it by the difference of two non-negative ones, x = x' - x'' (x', x'' >= 0); at most one of them is basic, and x is recovered at the end.