ECE 846, HA4 Hint: 8 Feb 2020

Q1. Put the solutions in an excel sheet in two columns. Calculate next three columns as their
objective values (f1 to f3). I would suggest you use -f2 to convert max problem to a min
problem. Then, Identify the non-dominated solution using the Dominance Relationship
discussed in Slide 11 of Module 3.

Q2. Understand the pay-off table method which is discussed on Slide 26. To create the
table, you need to first find minimum solution x*(i) of i-th objective function independently.
You can use Matlab’s fmincon() routine or you can look at the structure of the functions to
find what x*(i) should make the function minimum. You have enough background now to do
so. Then, complete the pay-off table by computing other two obj functions for each x*(i).
Then, find the ideal and the nadir points using the lecture video and slides.

Q3. You need to follow a principle used in Slide 4 of Module 3.

(a) Pick a number of (x1,x2) solutions systematically (say 30 uniform points within 0 <=
x1 <= 1 and 30 uniform points within 0 <= x2 <= 1, totaling 900 points in total). Check
each of the 900 solutions against two constraints and variable bounds. If a point is
feasible, mark it in a x1-x2 plot and also mark a point in the f1-f2 place by computing
respective f1 and f2 values. Clearly indicate which is the variable space and which is
the objective space. Can you mark the efficient set and Pareto-optimal (PO) set on
the two plots, knowing that both objectives have to be minimized? Remember the
third quadrant concept. See Slide 8.
(b) Then, indicate weak PO set and weak efficient set using third quadrant, but axis
points are not included now to dominate a point. See Slide 16.
(c) Do you suppose any (f1,f2) point which is efficient can come from more than one
point from the variable space? Then those points have to be excluded from the
Pareto and efficient sets found in (a). See Slide 17.
(d) If you plot your figures in scale, you can then plot two lines with slope L and 1/L to
identify the left-most and right-most parts of the efficient set (in (a)) which are not
properly efficient. Mark the respective PO points. See Slide 20.
Think if somehow you can answer the questions by using the mathematical functions to plot
the feasible variable and objective space, instead of 900 points. You may earn some bonus
points for it, but it is not mandatory.