6/30/2021 Make-up Quiz (UMA035): Attempt review
Dashboard My courses UMA035-2021EVESEM About the course Make-up Quiz (UMA035)
Started on Friday, 18 June 2021, 4:00 PM
State Finished
Completed on Friday, 18 June 2021, 4:11 PM
Time taken 11 mins 40 secs
Grade 6.00 out of 10.00 (60%)
Question 1
Correct
Mark 1.00 out of 1.00
In an assignment problem with 5 jobs and 5 machines, the number of
basic variables is
25
10
9
24
Your answer is correct.
The correct answer is:
9
https://ada-lms.thapar.edu/moodle/mod/quiz/review.php?attempt=463056&cmid=55043 1/6
6/30/2021 Make-up Quiz (UMA035): Attempt review
Question 2
Correct
Mark 1.00 out of 1.00
Which may be affected on changing the
coefficient of a decision variable in the objective function of a linear
programming problem?
Both Optimality and Feasibility
Feasibility
None of these
Optimality
Your answer is correct.
The correct answer is:
Optimality
Question 3
Incorrect
Mark 0.00 out of 1.00
For a NLPP, having 4 constraints and 3 variables
the order of Bordered Hessian matrix is
6×6
None of these
3×4
4×3
Your answer is incorrect.
The correct answer is:
None of these
https://ada-lms.thapar.edu/moodle/mod/quiz/review.php?attempt=463056&cmid=55043 2/6
6/30/2021 Make-up Quiz (UMA035): Attempt review
Question 4
Incorrect
Mark 0.00 out of 1.00
Which of the following is a non-linear programming
problem?
M ax(|x1 + x2 |) Subject to x1 + x2 = 1, x1 ≥ 0, x2 ≥ 0
M ax(|x1 | − |x2 |) Subject to x1 + x2 = 1, x1 ≥ 0, x2 ≥ 0
M ax(|x1 − x2 |) Subject to x1 + x2 = 1, x1 ≥ 0, x2 ≥ 0
M ax(|x1 | + |x2 |) Subject to x1 + x2 = 1, x1 ≥ 0, x2 ≥ 0
Your answer is incorrect.
The correct answer is:
M ax(|x1 + x2 |) Subject to x1 + x2 = 1, x1 ≥ 0, x2 ≥ 0
Question 5
Incorrect
Mark 0.00 out of 1.00
If C is a
matrix of order n × 1 and X is a matrix of order 1 × n.
then which of the following represents
the objective function of a linear programming problem in its matrix form.
C × X
T
T T
C × X
C × X
× X
T
C
Your answer is incorrect.
The correct answer is:
C
T
× X
T
https://ada-lms.thapar.edu/moodle/mod/quiz/review.php?attempt=463056&cmid=55043 3/6
6/30/2021 Make-up Quiz (UMA035): Attempt review
Question 6
Correct
Mark 1.00 out of 1.00
Dual- Simplex method indicates that there does not
exists any feasible solution of a linear programming problem
There exists tie between two or more entering
variables
There exist an entering variable but there does not
exists any leaving variable
There exist a leaving variable but there does not
exists any entering variable
There exists tie between two or more leaving
variables
Your answer is correct.
The correct answer is:
There exist a leaving variable but there does not
exists any entering variable
Question 7
Correct
Mark 1.00 out of 1.00
Which of the following is a convex set?
Set of real numbers
Set of integers
Set of rational numbers
Set of rational numbers
Your answer is correct.
The correct answer is:
Set of real numbers
https://ada-lms.thapar.edu/moodle/mod/quiz/review.php?attempt=463056&cmid=55043 4/6
6/30/2021 Make-up Quiz (UMA035): Attempt review
Question 8
Correct
Mark 1.00 out of 1.00
There are six variables and four
linearly independent constraints in the standard form of a linear programming
problem. Then, the number of basic feasible solutions will be
15
≥ 15
≤ 15
None of these
Your answer is correct.
The correct answer is:
≤ 15
Question 9
Correct
Mark 1.00 out of 1.00
Which of the following is correct?
Every optimal solution of a linear programming
problem is a basic solution
Every optimal solution of a linear programming
problem is a basic feasible solution
Every optimal solution of a linear programming
problem is a feasible solution
None of these
Your answer is correct.
The correct answer is:
Every optimal solution of a linear programming
problem is a feasible solution
https://ada-lms.thapar.edu/moodle/mod/quiz/review.php?attempt=463056&cmid=55043 5/6
6/30/2021 Make-up Quiz (UMA035): Attempt review
Question 10
Incorrect
Mark 0.00 out of 1.00
If in Big-M method for Linear programming problem an artificial
variable remains at positive level in
the optimal
table , then solution is
unbounded
None of these
Infeasible
Unique
optimal solution
Your answer is incorrect.
The correct answer is:
Infeasible
Previous activity
◄ Second Quiz -UMA035
Jump to...
Next activity
Course Lecture Videos ►
Stay in touch
Thapar Institute of Engineering & Technology
P.O. Box 32, Bhadson Road,
Patiala, Punjab,
Pin -147004, India
Copyright © 2020 - Developed by CITM- Thapar Institute powerd by Moodle.
https://www.thapar.edu
https://ada-lms.thapar.edu/moodle/mod/quiz/review.php?attempt=463056&cmid=55043 6/6
