Scribd
Upload
101 views

Operations Research - Unit 6 - Week 4 PDF

This document is a summary of Week 4 content for an online NPTEL Operations Research course. It includes lessons on the weak duality theorem, more duality theorems, the primal-dual relationship of solutions, the dual simplex method, and sensitivity analysis. It also lists an upcoming quiz titled "Assignment - 4" with 10 multiple choice questions related to these duality topics. The questions cover concepts like complementary slackness conditions, determining the dual problem of a given primal problem, and solving linear programs using the dual simplex method.

Uploaded by

Satyam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
101 views

Operations Research - Unit 6 - Week 4 PDF

This document is a summary of Week 4 content for an online NPTEL Operations Research course. It includes lessons on the weak duality theorem, more duality theorems, the primal-dual relationship of solutions, the dual simplex method, and sensitivity analysis. It also lists an upcoming quiz titled "Assignment - 4" with 10 multiple choice questions related to these duality topics. The questions cover concepts like complementary slackness conditions, determining the dual problem of a given primal problem, and solving linear programs using the dual simplex method.

Uploaded by

Satyam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

X

[email protected]

(https://swayam.gov.in)      
(https://swayam.gov.in/nc_details/NPTEL)

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Operations Research (course)

Announcements (announcements) About the Course (preview) Ask a Question (forum) Progress (student/home) Mentor (student/mentor)

Unit 6 - Week 4

Course outline

How does an NPTEL online course work?

Week 0

Week 1

Week 2

Week 3

Week 4

Weak Duality Theorem (unit?unit=25&lesson=26)

More Duality Theorems (unit?unit=25&lesson=27)

Primal-Dual relationship of solutions (unit?unit=25&lesson=28)

Dual Simplex Method (unit?unit=25&lesson=29)

Sensitivity Analysis-I (unit?unit=25&lesson=30)

Quiz : Assignment - 4 (assessment?name=82)

Week 5

Weekly Feedback

DOWNLOAD VIDEOS

Text Transcripts

Assignment - 4
Assignment not submitted Due date: 2020-10-14, 23:59 IST.

1) Which of the following is False: 1 point

The value of the objective function of the maximum (primal) problem for any (primal) feasible solution is a lower bound
to the minimum value of the dual objective.
The value of the objective function of the minimum (dual) problem for any (dual) feasible solution is a upper bound to
the maximum value of the primal objective.
If the primal problem is feasible and its objective function value is unbounded, (f → + ∞) then dual has an infeasible
solution.
If the primal problem is feasible and its objective function value is  unbounded, (f → + ∞) then dual has multiple
solutions.
2) Let the Primal be: Min f = 2x1 – 15x2 1 point
                              s.t.       2x1 + 3x2 > 6 
                                          –x1         > –10            
                                            x1 , x2 > 0.
Then the solution of the corresponding Dual is: 

Unbounded
Infeasible
(0, 2)
(2, 0)
3) Which of the following is False: 1 point

If dual is feasible and primal is infeasible, then dual is bounded.


If primal is feasible and dual is infeasible, then primal is unbounded.
If dual is feasible and primal is infeasible, then dual is unbounded.
If the dual is feasible and is unbounded, (w → – ∞) then the primal problem is infeasible.
4) Let the Primal be:     Max f = 3x1 + 5x2      1 point
                                        s.t. – 2x1 + x2 < 2 
                                                          x2 < 9                  
                                                    x1 , x2 > 0.
Then the solution of the corresponding Dual is:

Infeasible
Unbounded
(2, 3)
(2, 5)
5) Which of the following is not one of the four Complimentary Slackness Conditions: 1 point

If a primal variable is positive, then the corresponding dual constraint will be satisfied as an equation at the optimum.
If a primal constraint is a strict inequality at the optimum, then the corresponding dual variable must be zero at the
optimum.
If a dual variable is positive, then the primal constraint will be satisfied as an equation at the optimum.
The dual of the dual is the Primal.
6) The principle of Complementary Slackness states that: 1 point

Primal Slack Variable x Dual Variable = 0


Primal Variable x Dual Surplus Variable = 0
Both of (A) and (B)
None of the above
7) If at the optimality a primal constraint has positive value of slack variable, then: 1 point

dual variable corresponding to that constraint has zero value.


corresponding resource has not been used up.
corresponding resource has zero opportunity cost.
Both (B) and (C), but not (A).
8) The shadow price is: 1 point

The price that is paid for purchase of resource.


The saving by eliminating one of the excess quantities of resource.
The increase in the objective function value by providing one additional unit of resource.
The decrease in the objective function value by providing one additional unit of resource.
    9)
   Corresponding to the following primal problem, what will be the solution of dual; 1 point
Minimize x1 +2x2  s.t. x1 + 3x2 ³ 4, 7x1 + 5x2 ³ 8 x1 ³ 0, x2 ³ 0.

(9/16, 1/16) : 11/4


(1/16, 9/16) : 11/4
(9/16, 11/16) :19/4
(1/16, 1/16) : 3/4
10) The solution of the following LPP by Dual Simplex Method is given by:    1 point
                    Minimize        Z = 2x1 + 4x2 + x3 
                     Subject to    x1 + x2 + x3 - x4 ³ 2
                                       – 2x1 + x2 - 4x3 + x4 ³ 4
                                           x1,  x2 ,  x3 , x4 ³ 0.

(0, 3, 0, 0) with z = 12
(0, 3, 0, 1) with z = 12
(6, 0, 0, 0) with z = 12
(1, 3, 0, 0) with z = 14
You may submit any number of times before the due date. The final submission will be considered for grading.
Submit Answers

You might also like