0% found this document useful (0 votes)
39 views

Week 06 Assignment

1) This document is an assessment submitted for an online course on Introduction to Soft Computing through NPTEL. It contains 10 multiple choice questions related to multi-objective optimization problems. 2) The assessment covers topics from Week 6 of the course including concepts of domination, non-Pareto based approaches like lexicographic ordering and VEGA, and Pareto-based approaches like NPGA. 3) Students are allowed multiple attempts at the assessment and their final submission before the due date will be considered for grading.

Uploaded by

gohoj57606
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
39 views

Week 06 Assignment

1) This document is an assessment submitted for an online course on Introduction to Soft Computing through NPTEL. It contains 10 multiple choice questions related to multi-objective optimization problems. 2) The assessment covers topics from Week 6 of the course including concepts of domination, non-Pareto based approaches like lexicographic ordering and VEGA, and Pareto-based approaches like NPGA. 3) Students are allowed multiple attempts at the assessment and their final submission before the due date will be considered for grading.

Uploaded by

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

3/6/24, 5:47 PM Introduction To Soft Computing - - Unit 9 - Week 6

Assessment submitted.
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
X

[email protected]

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Introduction To Soft Computing (course)

If already
registered, click
Thank you for taking the Week 06
to check your
payment status
: Assignment 06.

Course Week 06 : Assignment 06


outline Your last recorded submission was on 2024-03-06, 17:47 Due date: 2024-03-06, 23:59 IST.
IST
About
1) What property does the domination relation in a multi-objective optimization 2 points
NPTEL ()
problem exhibit?

How does an a. Reflexive


NPTEL
b. Symmetric
online
course c. Transitive
work? () d. Antisymmetric

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)

Quiz: Week a. An a priori technique employing stochastic sampling.


06 : b. A posteriori technique based on dominance relationships.
Assignment
c. An a priori technique based on the principle of "aggregation with ordering."
06
(assessment? d. A selection strategy involving tournament-based competition.
name=136)
9) In the context of Multi-Objective Genetic Algorithms (MOGA), what does "fitness 2 points
Feedback
Form (unit?
sharing" refer to?
unit=66&lesso
a. A technique for evaluating the fitness of individuals based on their Pareto dominance.
n=73)
b. A mechanism for sharing the fitness values equally among all individuals in the
Week 7 () population.
c. An approach for preventing premature convergence by penalizing solutions that are too
Text similar.
Transcripts ()
d. A method for randomly selecting individuals for crossover and mutation operations.

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

10) What is a significant disadvantage of the Vector-Evaluated Genetic Algorithm 2 points


Download
Assessment submitted. (VEGA) regarding solution dominance?
X Videos ()
a. Solutions are locally and globally dominated
Books ()
b. Solutions are Pareto-dominated and globally dominated
c. Solutions are locally non-dominated but not necessarily globally dominated.
d. Solutions are locally and globally non-dominated

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

You might also like