UGC NET CS - Linear programming Quiz
Question 1
Consider the following transportation problem:
The initial basic feasible solution of the above transportation problem using Vogel\'s Approximation Method (VAM) is given below :
The solution of the above problem:
The initial basic feasible solution of the above transportation problem using Vogel\'s Approximation Method (VAM) is given below :
The solution of the above problem:
Question 2
Given the following statements with respect to linear programming problem:
S1: The dual of the dual linear programming problem is again the primal problem
S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.
S3: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?
Question 3
The following LPP
Maximize z=100x1 +2x2 +5x3
Subject to
14x1 +x2 −6x3 +3x4 =7
32x1 +x2 −12x3 ≤10
3x1 −x2 −x3 ≤0
x1 , x2 , x3 , x4/0
has
There are 3 questions to complete.
Last Updated :
Take a part in the ongoing discussion