While solving a linear programming problem in feasibility may be removed by.
A. adding another constraint
B. adding another variable
C. removing a constraint
D. removing a variable
ANSWER: C
In the optimal simplex table, Zj-Cj-0 value indicates
A. alternative solution
B. bounded solution
C. infeasible solution
D. unbounded solution
ANSWER: A
If any value in XB column of final simplex table is negative, then the solution is
A. infeasible
B. unbounded
C. bounded
D. no solution
ANSWER: A
If all alj values in the entering variable column of the simplex table are negative, then
A. there are multiple solutions
B. there exist no solution
C. solution is degenerate
D. solution is unbounded
ANSWER: D
NTSC is an acronym for.
A. Neutral Television Standard Council
B. National Television Standard Council
C. National Television System Committee
D. National Television Standard Committee
ANSWER: C
