Selected Topics in Decision Modeling - - Unit 5 ... https://onlinecourses.nptel.ac.in/noc18_mg32/un...

[email protected] ▼

Courses » Selected Topics in Decision Modeling

Announcements Course Ask a Question Progress Mentor FAQ

Unit 5 - Week 4

Course
outline
Week 4 Assignment 4
The due date for submitting this assignment has passed. Due on 2018-09-12, 23:59 IST.
How to access As per our records you have not submitted this assignment.
the portal
1) Which one of the following statement is not true about Exhaustive enumeration technique for 1 point
Week 1 solving Integer Linear Programming problems?

Week 2 i. Exhaustive enumenration generates all possible integer solutions

ii. Exhaustive enumenration evaluates all possible integer solutions

Week 3
iii. Exhaustive enumenration chooses the optimal among all possible integer solutions
Week 4
iv. Exhaustive enumenration cannot gurantee an optimal solution
Lecture 16 :
Exhaustive
No, the answer is incorrect.
Enumeration Score: 0
and Branch and Accepted Answers:
Bound
iv. Exhaustive enumenration cannot gurantee an optimal solution
Techniques

Lecture 17 : 2) Total number of enumerations required for a 0-1 knapsack problem with 5 binary variables will 1 point
Branch and be:
Bound
Technique i. 10
Lecture 18 : ii. 16
Assignment and
Travelling iii. 25
Salesman
Problem iv. 32

Lecture 19 : No, the answer is incorrect.

Travelling Score: 0
Salesman
Problem Accepted Answers:
(Contd.) iv. 32

Lecture 20 : 3) Number of basic steps in the Branch and Bound algorithm are: 1 point
Heuristic
Methods for i. 2
Integer
Programming ii. 3
Lecture Material iii. 4
Feedback for iv. 5
Week 4
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -
No, the answer is incorrect.
Quiz
A project of : Week 4 In association with
Score: 0
Assignment 4
Accepted Answers:
Week 5 ii. 3
Funded by
4) A valid bound for an Integer Linear Programming problem can be found by: 1 point

1 of 5 Tuesday 16 October 2018 05:01 PM

Selected Topics in Decision Modeling - - Unit 5 ... https://onlinecourses.nptel.ac.in/noc18_mg32/un...

Powered by
Week 6 i. By Relaxing one or more constraints

ii. Considering Non-negativity constraints

Week 7
iii. By Linear Programming relaxation
Week 8
iv. None of the above

Download Videos No, the answer is incorrect.

Score: 0
Assignment
Solution Accepted Answers:
iii. By Linear Programming relaxation

5) 1 point

i.

ii.

iii.

iv.

No, the answer is incorrect.

Score: 0
Accepted Answers:
iii.

6) 1 point

i.

ii.

iii.

iv.

No, the answer is incorrect.

Score: 0
Accepted Answers:
i.

2 of 5 Tuesday 16 October 2018 05:01 PM

Selected Topics in Decision Modeling - - Unit 5 ... https://onlinecourses.nptel.ac.in/noc18_mg32/un...

7) Consider Question 6 again. Having found the bound for the total solution, we need to find the 1 point
branches. Number of such branches will be:

i. 2

ii. 3

iii. 4

iv. 5

No, the answer is incorrect.

Score: 0
Accepted Answers:
iii. 4

8) While finding optimal solution for a Travelling Salesman problem, sub-tours are to be blocked 1 point
because:

i. All sub-tours cannot be found

ii. Some sub-tours are not possible to cover

iii. Travelling Salesman problem considers only some sub-tours, not all

iv. Travelling Salesman problem considers only complete tours, not sub-tours

No, the answer is incorrect.

Score: 0
Accepted Answers:
iv. Travelling Salesman problem considers only complete tours, not sub-tours

9) It is known that solution of the corresponding Assignment Problem provides a bound for a 1 point
Travelling Solution Problem. Hence, the optimal solution for a Travelling Salesman Problem and the
corresponding Assignment problem will be:

i. Always same

ii. Always different

iii. Sometime same

iv. Not related at all

No, the answer is incorrect.

Score: 0
Accepted Answers:
iii. Sometime same

10) 1 point

i. 20

ii. 21

iii. 22

3 of 5 Tuesday 16 October 2018 05:01 PM

Selected Topics in Decision Modeling - - Unit 5 ... https://onlinecourses.nptel.ac.in/noc18_mg32/un...

iv. 24

No, the answer is incorrect.

Score: 0
Accepted Answers:
i. 20

11)Consider the Travelling Salesman Problem of Question 10. The optimal tour for the minimum 1 point
tour length will be:

i. A-B-C-D-A

ii. A-C-B-D-A

iii. A-B-D-C-A

iv. A-C-D-B-A

No, the answer is incorrect.

Score: 0
Accepted Answers:
ii. A-C-B-D-A

12)Consider the Travelling Salesman Problem of Question 10. In order to solve the problem, we 1 point
need to replace distance between A to A, B to B, C to C, and D to D by:

i. 0

ii. Lowest distance in the matrix

iii. Highest distance in the matrix

iv. A very high value M

No, the answer is incorrect.

Score: 0
Accepted Answers:
iv. A very high value M

13)While Solving a Travelling Salesman Problem of 6 cities, unique assignment obtained after 1 point
some iteration is: A-D, B-C, C-E, D-B, E-F and F-A. What can you infer about the optimal solution of the
Travelling Salesman Problem (TS Problem)?

i. The unique assignments constitute an optimal solution

ii. The unique assignments are not feasible

iii. The unique assignments are feasible but do not constitute an optimal solution

iv. None of the above

No, the answer is incorrect.

Score: 0
Accepted Answers:
i. The unique assignments constitute an optimal solution

14)While Solving a Travelling Salesman Problem of 6 cities by Branch and Bound Technique, 1 point
unique assignments obtained after some iteration are: A-D, B-C, C-A, D-B, E-F and F-E. What can you
infer about the optimal solution of the Travelling Salesman Problem (TS Problem)?

i. The unique assignments constitute an optimal TS Problem solution

ii. The unique assignments constitute a TS Problem solution which is not optimal

iii. The unique assignments do not constitute a feasible TS Problem solution

iv. None of the above

No, the answer is incorrect.

Score: 0

4 of 5 Tuesday 16 October 2018 05:01 PM

Selected Topics in Decision Modeling - - Unit 5 ... https://onlinecourses.nptel.ac.in/noc18_mg32/un...

Accepted Answers:
iii. The unique assignments do not constitute a feasible TS Problem solution

15)Nearest Neighbour Heuristic is used to solve a Travelling Salesman Problem. A feasible 1 point
solution to the problem is obtained. Which one of the following observations will be true?

i. The solution obtained will be always optimal

ii. The solution obtained may be optimal

iii. The solution obtained will be never optimal

iv. The solution obtained will be most likely optimal

No, the answer is incorrect.

Score: 0
Accepted Answers:
ii. The solution obtained may be optimal

Previous Page End

5 of 5 Tuesday 16 October 2018 05:01 PM