Week 06 Assignment
Week 06 Assignment
Assessment submitted.
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
X
If already
registered, click
Thank you for taking the Week 06
to check your
payment status
: Assignment 06.
Week 0 () 2) Consider two solutions, P and Q, for a problem where we want to minimize two 2 points
objectives. The solutions with their objective values are: Which of the
Week 1 () following are True?
Week 2 () a. P dominates Q.
b. Q dominate P.
Week 3 () c. Both dominate each other.
d. None of the above
Week 4 ()
3) Which of the following statements accurately describes the relationship between 2 points
Week 5 ()
non-dominance sets and Pareto optimal sets in multi-objective optimization?
Week 6 () a. The non-dominance and Pareto optimal sets are the same and can be used
interchangeably.
Lecture
26:Concept of b. The non-dominance set is a strict subset of the Pareto optimal set.
domination c. The Pareto optimal set is a strict subset of the non-dominance set.
(unit?
d. The non-dominance set and the Pareto optimal set are unrelated concepts.
unit=66&lesso
n=67)
https://onlinecourses.nptel.ac.in/noc24_cs37/unit?unit=66&assessment=136 1/3
3/6/24, 5:47 PM Introduction To Soft Computing - - Unit 9 - Week 6
Lecture 27: 4) Which of the following is NOT included in the list of non-Pareto-based multi- 2 points
Assessment submitted. objective optimization approaches?
Non-Pareto
X based
approaches to a. Lexicographic ordering
solve MOOPs b. Criterion selection (VEGA)
(unit?
c. Simple weighted approach (SOEA)
unit=66&lesso
n=68) d. Non-dominated Sorting based approach (NSGA)
Lecture 28:
5) What does the term "middling performance" refer to in the context of the VEGA 2 points
Non-Pareto
approach?
based
approaches to
a. Excellent performance in all objectives
solve MOOPs
(Contd.) (unit? b. Poor performance in all objectives
unit=66&lesso c. Results neither very bad nor very good
n=69)
d. Global optimization
Lecture 29:
Pareto-Based 6) What is the basis of NPGA (Niched Pareto Genetic Algorithm) in its selection 2 points
approaches to
scheme?
solve MOOPs
(unit? a. Roulette wheel selection
unit=66&lesso
b. Tournament selection and Pareto dominance.
n=70)
c. Stochastic universal sampling
Lecture 30:
Pareto-based
d. Rank-based selection
approaches to
solve MOOPs 7) How does NPGA determine the winner solution in its tournament selection? 2 points
(contd..) (unit?
unit=66&lesso a. The solution with the highest fitness value wins.
n=71) b. The solution with the lowest fitness value wins.
Lecture c. The solution based on Pareto dominance principle wins.
material of d. The solution selected randomly wins.
Week 6 (unit?
unit=66&lesso
8) What is the lexicographic ordering method in multi-objective optimization? 2 points
n=72)
https://onlinecourses.nptel.ac.in/noc24_cs37/unit?unit=66&assessment=136 2/3
3/6/24, 5:47 PM Introduction To Soft Computing - - Unit 9 - Week 6
You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers
https://onlinecourses.nptel.ac.in/noc24_cs37/unit?unit=66&assessment=136 3/3