LPP

Question 1
Consider the following LPP :
Max Z = 15x1 + 10x2
Subject to the constraints
4x1 + 6x2 ≤ 360
3x1 + 0x2 ≤ 180
0x1 + 5x2 ≤ 200
x1, x2 / 0
The solution of the LPP using Graphical solution technique is :
A
x1=60, x2=0 and Z=900
B
x1=60, x2=20 and Z=1100
C
x1=60, x2=30 and Z=1200
D
x1=50, x2=40 and Z=1150
       LPP       Graphical-Solution-Technique       UGC NET CS 2017 Nov- paper-3
Question 2
Consider the following LPP :
Min Z = 2x1 + x2 + 3x3
Subject to :
x1 − 2x2 + x3 ≥ 4
2x1 + x2 + x3 ≤ 8
x1 − x3 ≥ 0
x1, x2, x3 ≥ 0
The solution of this LPP using Dual Simplex Method is :
A
x1=0, x2=0, x3=3 and Z=9
B
x1=0, x2=6, x2=0 and Z=6
C
x1=4, x2=0, x2=0 and Z=8
D
x1=2, x2=0, x2=2 and Z=10
       LPP       Dual-Simplex-Method       UGC NET CS 2017 Nov- paper-3
Question 3
Which of the following statements is true?
A
The sentence S is a logical consequence of S1,.., Sn if and only if S1 ∧ S2 ∧.... ∧ Sn → S is satisfiable.
B
The sentence S is a logical consequence of S1,..., Sn if and only if S1 ∧ S2 ∧........ ∧Sn → S is valid.
C
The sentence S is a logical consequence of S1,..., Sn if and only if S1 ∧ S2 ∧........ ∧ Sn ∧ S is consistent.
D
The sentence S is a logical consequence of S1,..., Sn if and only if S1 ∧ S2 ∧........ ∧ Sn ∧ S is inconsistent.
       LPP       Satisfiability       UGC NET CS 2017 Jan- paper-3
Question 4
A t-error correcting q-nary linear code must satisfy:

Where M is the number of code words and X is
A
qn
B
qt
C
q-n
D
q-t
       LPP       Linear-Code       UGC NET CS 2017 Jan- paper-3
Question 5
With respect to a loop in the transportation table, which one of the following is not correct?
A
Every loop has an odd no. of cells and at least 5.
B
Closed loops may or may not be square in shape.
C
All the cells in the loop that have a plus or minus sign, except the starting cell, must be occupied cells.
D
Every loop has an even no. of cells and at least four.
       LPP       Transportation-Problem       UGC NET CS 2017 Jan- paper-3
Question 6
At which of the following stage(s), the degeneracy do not occur in transportation problem ? (m, n represents number of sources and destinations respectively)
(a) While the values of dual variables ui and vj cannot be computed.
(b) While obtaining an initial solution, we may have less than m + n – 1 allocations.
(c) At any stage while moving towards optimal solution, when two or more occupied cells with the same minimum allocation become unoccupied simultaneously.
(d) At a stage when the no. of +ve allocation is exactly m + n – 1.
A
(a), (b) and (c)
B
(a), (c) and (d)
C
(a) and (d)
D
(a), (b), (c) and (d)
       LPP       Transportation-Problem       UGC NET CS 2017 Jan- paper-3
Question 7
Consider the following LPP :
Min. Z = X1 + X2 + X3
Subject to 3X1 + 4X3 ≤ 5
5X1 + X2 + 6X3 = 7
8X1 + 9X3 ≥ 2,
X1, X2, X3 ≥ 0
The standard form of this LPP shall be :
A

B
C
D
       LPP       Standard-Form       UGC NET CS 2017 Jan- paper-3
Question 7 Explanation: 
Question 8
The region of feasible solution of a linear programming problem has a _____ property in geometry, provided the feasible solution of the problem exists.
A
concavity
B
convexity
C
quadratic
D
polyhedron
       LPP       Convexity       UGC NET CS 2016 July- paper-3
Question 8 Explanation: 
→ The region of feasible solution of an LP problem has a convexity property in geometry, provided the feasible solution of the problem exists.

→ The basic feasible solutions for a standard form LP are vertices for the convex set of feasible solution for the LP.

→ If an LP has a finite optimal objective function value, then the optimal value occurs at at least one basic feasible solution.

Question 9
Consider the following statements:
(a) Revised simplex method requires lesser computations than the simplex method.
(b) Revised simplex method automatically generates the inverse of the current basis matrix.
(c) Less number of entries are needed in each table of revised simplex method than usual simplex method.
Which of these statements are correct?
A
(a) and (b) only
B
(a) and (c) only
C
(b) and (c) only
D
(a), (b) and (c)
       LPP       Simplex       UGC NET CS 2016 July- paper-3
Question 10
The following transportation problem: is
A
infeasible solution
B
optimum solution
C
non-optimum solution
D
unbounded solution
       LPP       Transportation-Problem       UGC NET CS 2016 July- paper-3
Question 11
Consider the following linear programming problem :
Max. z = 0.50 x2 – 0.10x1
Subject to the constraints
2x1 + 5x2 < 80
x1 + x2 < 20
and x1, x2 > 0
The total maximum profit (z) for the above problem is :
A
6
B
8
C
101
D
12
       LPP       Maximum-Profit       UGC NET CS 2016 Aug- paper-3
Question 12
Consider the following statements : 
(a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal solution. 
(b) If primal (dual) problem has an unbounded optimal solution, then its dual (primal) has no feasible solution at all. 
(c) Both primal and dual problems may be infeasible. 
Which of the following is correct ?
A
(a) and (b) only
B
(a) and (c) only
C
(b) and (c) only
D
(a), (b) and (c)
       LPP       Duality       UGC NET CS 2016 Aug- paper-3
Question 13
Consider the following statements : 
(a) Assignment problem can be used to minimize the cost. 
(b) Assignment problem is a special case of transportation problem. 
(c) Assignment problem requires that only one activity be assigned to each resource. 
Which of the following options is correct ?
A
(a) and (b) only
B
(a) and (c) only
C
(b) and (c) only
D
(a), (b) and (c)
       LPP       Assignment-Problem       UGC NET CS 2016 Aug- paper-3
Question 14
In constraint satisfaction problem, constraints can be stated as __________.
A
Arithmetic equations and inequalities that bind the values of variables
B
Arithmetic equations and inequalities that doesn’t bind any restriction over variables
C
Arithmetic equations that impose restrictions over variables
D
Arithmetic equations that discard constraints over the given variables
       LPP       Satisfaction-Problem       UGC NET CS 2015 Dec - paper-3
Question 15
A basic feasible solution of a linear programming problem is said to be __________ if at least one of the basic variables is zero.
A
degenerate
B
non-degenerate
C
infeasible
D
unbounded
       LPP       Feasible-Solution       UGC NET CS 2015 Dec - paper-3
Question 15 Explanation: 
Feasible Solution: The set of values of decision variables Xj (j = 1, 2, ... n) which satisfy all the constraints and non-negativity conditions of a linear programming problem simultaneously is said to constitute the feasible solution to that problem.
Basic Solution: For a set of m simultaneous equations in n variables (n > m), a solution obtained by setting (n – m) variables equal to zero and solving for remaining m variables is called a “basic feasible solution”.
Basic Feasible Solution: A feasible solution to LP problem which is also the basic solution is called the “basic feasible solution”. Basic feasible solutions are of two types;
(a) Degenerate: A basic feasible solution is called degenerate if value of at least one basic variable is zero.
(b) Non-degenerate: A basic feasible solution is called ‘non-degenerate’ if all values of m basic variables are non-zero and positive.
Hence the correct option is option(A)
Question 16
Consider the following conditions:
(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b)The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns. 
(c)All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
A
(a) and (b) only
B
(a) and (c) only
C
(b) and (c) only
D
(a), (b) and (c)
       LPP       Generate-And-Non-Gegenerate       UGC NET CS 2015 Dec - paper-3
Question 16 Explanation: 
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
→The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
→The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns.
→All the positive allocations must be in independent positions.
Question 17
Consider the following transportation problem:

The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is:
A
1450
B
1465
C
1480
D
1520
       LPP       Transportation-Problem       UGC NET CS 2015 Dec - paper-3
Question 18
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost is equal to the number of:
A
rows or columns
B
rows + columns
C
rows + columns - 1
D
rows + columns + 1
       LPP       Assignment-Problem       UGC NET CS 2015 June Paper-3
Question 18 Explanation: 
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost is equal to the number of rows or columns.
Question 19
Consider the following transportation problem:
A
is degenerate solution
B
is optimum solution
C
needs to improve
D
is infeasible solution
       LPP       Transportation-Problem       UGC NET CS 2015 June Paper-3
Question 19 Explanation: 
Step1: In vogel’s approximation method first find out the row difference(by calculating the difference between the two smallest values of that row) and column difference(by calculating the difference between the two smallest values of that row)
Then select the row having highest row difference and after selecting row choose the column/cell of that row having minimum value.
After that fulfill the demand by using supply from the selected row and column.
After that if demand becomes zero then delete that column and if the row become zero then delete that row and then repeat step 1.
Question 20
Given the following statements with respect to linear programming problem:
S​ 1​ : The dual of the dual linear programming problem is again the primal problem
S​ 2​ : If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.
S​ 3​ : 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?
A
S​ 1​ and S​ 2
B
S​ 1​ and S​ 3
C
S​ 2​ and S​ 3
D
S​ 1​ , S​ 2​ and S​ 3
       LPP       Duality       UGC NET CS 2015 June Paper-3
Question 20 Explanation: 
S​ 1​ : TRUE: The dual of the dual linear programming problem is again the primal problem
S​ 2​ : TRUE: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.
S​ 3​ : TRUE: 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.
Question 21

Consider the following statements with respect to duality in LPP:
(a) The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself.
(b) If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution.
(c) If either problem has an unbounded optimal solution, then the other problem has no feasible solution at all. Which of the statements is (are) correct?
A
only (a) and (b)
B
only (a) and (c)
C
only (b) and (c)
D
(a), (b) and (c)
       LPP       Duality       UGC-NET DEC-2019 Part-2
Question 21 Explanation: 
Duality in LPP:
TRUE: The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself.
TRUE: If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution.
TRUE: If either problem has an unbounded optimal solution, then the other problem has no feasible solution at all.
Question 22
A basic feasible solution of an mXn Transportation-Problem is said to be non-degenerate, if basic feasible solution contains exactly____number of individual allocation in ___positions
A
m+n+1, independent
B
m+n-1, independent
C
m+n-1, appropriate
D
m-n+1, independent
       LPP       Transportation-Problem       UGC-NET DEC-2019 Part-2
Question 22 Explanation: 
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
→The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
→The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns.
→All the positive allocations must be in independent positions
A few terms used in connection with transportation models are defined below.
1. Feasible solution: A feasible solution to a transportation problem is a set of non-negative allocations, xij that satisfies the rim (row and column) restrictions.
2. Basic feasible solution: A feasible solution to a transportation problem is said to be a basic feasible solution if it contains no more than m + n – 1 non – negative allocations, where m is the number of rows and n is the number of columns of the transportation problem.
3. Optimal solution: A feasible solution (not necessarily basic) that minimizes (maximizes) the transportation cost (profit) is called an optimal solution.
4. Non-degenerate basic feasible solution: A basic feasible solution to a (m x n) transportation problem is said to be non – degenerate if, the total number of non-negative allocations is exactly m + n – 1 (i.e., number of independent constraint equations), and these m + n – 1 allocations are in independent positions.
5. Degenerate basic feasible solution: A basic feasible solution in which the total number of non-negative allocations is less than m + n – 1 is called degenerate basic feasible solution.
Note: It is very standard and regular question and asked in UGC-NET Dec-2015 paper-3
Ref-https://solutionsadda.in/ugc-net-cs-2015-dec-paper-3/
There are 22 questions to complete.
PHP Code Snippets Powered By : XYZScripts.com
error: Content is protected !!