Lecture 34

IIT Kanpur July 201
20 followers
1 Video View·Mar 1, 2024
uh a very good morning good afternoon
good evening to all my dear students
participants uh this is the course
multicriteria decision making under
npm and my good name is raghunandan s
Gupta from the IM department at diur in
India so as you know that we this total
course is for 60
lectures spread over 12
weeks and each week we have um three
five sessions or lectures and each
lecture is for half an hour the broader
ideas which we are still considering is
multicriteria decision making and ideas
we are still discussing for a long time
in the the weeks of the classes
multiobjective decision
making then we'll consider
multiattribute decision making
multiattribute utility Theory and then
going into the concept of more
qualitative decision making in
discussion this is the 34th lecture on
the 60 lecture series
course now as we were discussing in the
last class we are discussing in linear
programming with three objectives and
they were marked as fub1 F2 F3 and to
make things more clear I have used
different coloring scheme red for the
first one Violet for the second one and
blue light blue for the third one
constraints are
same and also I did mention they were
all three worse maximization the
question can be easily answered they can
also be considered as minimization or
combination of maximization minimization
the idea remains
same in the first problem we considered
objective function
one as to be optimized which is
maximized and
constraints already existing were
increased by two in the sense the second
objective came as a part and parcel of
the constraint the third objective also
came as a part of and parcel of the
constraint and we'll continue the same
logic
for second problem solution third
problem solution so thus to make things
move in the line right direction three
objectives F1 F2
F3 as
shown so this
was this was fub1 in red F2 in Violet F3
in blue these are the
constraints we maximize them separately
and has the results are F1 star red for
first objective F2 star violet for the
second objective F3 star blue for the
third objective
this was the uh
solution for the
first this was the solution for the
second this means you have already seen
it so I'm not repeating it for the first
objective the solution points decision
points was 20 0 0 objective function
maximum was 40 for the second objective
which you are seeing now is the solution
of decision variables are 0 20 0
maximization is 40 for the third single
objective the solution points are 0 020
and the objective value is
40 now as I said I consider which you
are solving the last day in last d means
the last
lecture we consider objective function
one which I'll
mark As obj number one which is red in
color
the constraints 1 2 3 4 1
2
3 four are there fifth is
here and the sixth and the Seven which
is the additional one corresponding to
objective function two and objective
function three are shown in the
corresponding color which is sixth in
Violet I
writing and another is the blue one
which I'm
writing
7th they are all less than with their
corresponding F2 star and F3 star y less
than this is the objective function to
be maximized so we'll consider them
accordingly we took different values of
Delta 2 Delta 3 which you are to be
subtracted from F2 star and F3 star the
combinations are given in the first two
columns column one which is for Delta 2
violet color
column 2 Delta 3 in blue color and the
combinations of x's are given in the
third column with F1 double star which
is the corresponding changed values of
object Function One are given in the
First
Column so this is the so-called solution
of the first objective coning second and
third objectives are in the
constraint so Corr spondingly we take
other combinations of Delta 2 and Delta
3 and these are the 40 minus Delta 2 40
minus Delta 3 so the Delta 2 and Delta 3
are
given column
1 column
two based on that I have the solution
which is in column three and the finally
F1 star double star in the column four
they have been solved using simple
linear programming problem
problem having said that now we go into
next
stage next stage or second case in the
next stage next stage I actually should
be technically to be right next stage is
where we are solving each objective
function in the con in objective cases
and the left out objectives are being
dragged into the
constraints so this is the formulation
of object function
two Violet in color the E
existing constraints I use
a green one
2 3 4 and the fifth
one the sixth one is shown
here
and the seventh one is shown
here I have used coloring scheme to make
things clear and here also it is F3 star
minus Delta 3 and fub1 star minus Delta
1 so this is Delta
1 in order to avoid any confusion the
coloring scheme so when I solve it
interestingly the answers I
get so these Delta Del 3 and Delta 1 are
the
corresponding values of Delta which are
to be subtracted from the
third objective function which is there
in the constraint and the first
objective function which is there in the
constraint so that's why the coloring of
blue and
red so these are the values of 40 minus
here is 40 -
22 40 -
23 40 -
25 40 -
25 40 - 22 40 -
25 40 -
27 here also 40 - 22 40 -
23 40 -
25 40 - 22 2 40 -
25 40 -
27 40 -
25 when I solve it the corresponding
values of X1 X2 X3 are given
here third column and the value of F2
double star which is for the second
objective and double start Wings because
as they changing are given as
here so if you see the values of 39 38.5
I'm reading the last column would almost
be the same but the combination of X1 X2
X3 would change and I'll come to that
corresponding to more such combinations
of Delta 3 and Delta 1 so we have again
these are all 40 minus so this would
be
40
40 - 30 40 -
27 40 - 30
40 4 -
37 40 - 39 on the right hand side we are
related to the first objective being got
in the
constraint again 40 minus
27 so this will be again I'm repeating
right hand
side I'll write
it 40 - 32 40 -
30 40 -
37 14 - 35 14 -
39 so let us take one of these I should
I would also do it
for
the first example under case and the
second stage second stage probably means
maximizing single objective with the
other objective being brought into the
constraint so if I consider
this so
actually this 40 - 30 is is I write it
with different uh with the blue color is
10 and 40 minus 3 32 is
8 so what does 8 and 10 mean so 8 and 10
would basically
mean this for objetive function
two this 8 and
10
this is less than equal to fs3
minus 30 which is
10 and this would be 8 less than equal
to
8 So based on that we'll Solve
IT
similarly if I consider this see for
example arbitary let me
consider different value 25 25 for for
example this is the objective function
one with objective function two and
three in the
constraint this
one so this would be a violet
color 40 minus
25 is equal to
15 and for the blue one which is the
third
objective 40 - 25 is
15 so if I go back to the
problem this objetive function
one this is equal to less than equal to
15 this is equal to less than equal to
15 and we'll solve the problem for
objective function
one now we go into the last objective
function which is the third problem
under stage two or case three for stage
two this is the objective function which
is F3 which we all know so I'll just
write
obj objective
3 constraints this is one we know
already know this is two known to us
three
4 this is five and the red one and the
blue one which are corresponding ing to
object function this is again my mistake
this should be
one which are corresponding to objective
function one and and two are as
follows so this is the sixth
one and the Violet one is the 7eventh
one so with this I solve the problem
again I take Lambda 1 Lambda
2 as the part to be subtracted from fub1
star and F2
star so these values would be I'm again
writing 40 -
22 40 -
23 40 - 25 40 -
25 40 t - 22 40 -
25 t - 27 if I come to the second column
which is related to the second objective
function being posted into the
constraint again it is 40- 22 so this 40
Value which I'm wrting is just a
coincidence because I framed the problem
very simply so that everything can be
understood 40 - 23 for the 2 40 - 25 for
the Third third 40 - 22 40 - 25 40
- 27 40 -
25 so if I take any one Val
set which you will solve for example
this one first
one the values we I I'll I'll write it
but the values if I for all of them are
given
here third
column the objective values which is F3
double star in blue is in
the last column and continuing different
values being subtracted from F1 star and
F2 star which are red and
violet the corresponding values to be
subtracted from 40 R 30 27
correspondingly I'm not writing it 30 32
35 36 739 so all have to be subtracted
from 40 and for the other objective
function which is the second one the
values to be subtracted in 40 again are
these 27 30 32 30 37 35
39 the corresponding solution when they
solved these are X1 X2 X3 values and the
last common R values are the F3 star
which is the double star which is for
the third op
objective now coming back here I mark
this 40 - 22 and 40 -
22 which would be 18 in both the cases
so if I put in this
equation so this would
be less than equal to 18 this is one and
this would also be less than equal to 18
because they have been
formulated why 18 because they are 40 -
22 40 - 22
now where are the important and this I
will try to highlight using a
diagram I'll add
a blank sheet and draw it so let me draw
it this is
X3
this is
X2 this is
X1 now the solution if you remember was
20 02 0 0 0 20 so that is basically I'll
draw one by
one the points are coming out to be
first objective we use red so consider
this
is here is the
point second objective was violet
third objective was basically shown in
red
blue so
technically the points are
these now if I solve the problem and as
given let us go one by one the value of
the first
objective consider say for example
consider is this one so I will use the
red color because objective function
one so I will use
37.5 so it's 17.5 2.5
0 so
17.5 2.5 for X2 will go a little bit in
this direction and for X3 0 so it will
be on the flat plane X1 X2 no Delta
movement in X3
Direction so this is the point
one and the value if you remember I'll
write it here
36.5 so let us hunt for 36.5 for
objective function 2 solve with
objective function one and three in the
constraints so this was objective
function two with objective fun one and
three in the con in the constraints for
36.5 it
is
correctly it was 3.5 sorry not
2.5 for
37.5 it was 2.5 and 7.5
and 36.5 is 16.5 and 3.5 so I
was so it
is 16.5
3.50 so this is the 16.5 3.50 so I'm not
considering this one my
mistake
so that was objective Function One F1
red now for objective function two which
is F2
invalid this is this
value 0 16.5
3.5 so
0 16.5 it is this and 3.5 so it will
basically be
here so this should
be 16 uh 0 for X1 16.5 for X2 and 3.5
for
X3 these are the
points this is the point and lastly when
I
consider X3 to
be in the other point so I'm taking the
combinations and drawing it I'm not
drawing X1 X2 X3 as such I'm drawing
only those combinations which gives me
same values for F1 F2
F3 when I solve the third objective
function with the first and second the
constant for
36.5 and Mark
in
do this one I'm taking this 3.5 0
16.5
3.5 0 for
this 16.5 would be on that plane so
first was on the bottom plane if I
consider where I'm
standing where the the X are X1
X2 and then the second point which is
shown in in in wallet is on the left
wall if I'm standing in a room is the
left
wall and the third point which I just
mentioned is it is f away from me that
means between you and and the
participants and me so this is so this
is the
90° and the base is there floor wall one
wall two and and in the floor
x30 because we have measured X1 along
this direction from my left hand to the
right hand X2 is from the camera towards
me or from you towards me and X3 is from
if I consider the vertical light from
the base going
up so if I plot it the
point so the points were
basically
3.5 on
X1 X2 is
zero and XT
16.5 so this will somewhere
here see if I so the first point which
is red I'll mark in red because it's
related to the
one then the Violet one which I'll use
as two
and the blue one which I'll use as
three or for the case when the objective
function values are
36.5 so they are actually not nothing to
do with par points but I'm just showing
obviously there will be more
analysis so if I
join
so technically I can I have not solved
it I can plot such points where the
value of these individual functions
are 36. five so this year should also
write and I can solve them to Sol find
out now the issue is that can we find a
set of answers for X1 X2 X3 such that
the values remain the same and we get
the points according to the case where
the objective functions are fixed so
we'll consider that because considering
even though there are 2 minutes left two
to two 2 and a half minutes left but
considering that you have to go in depth
into the problem and and analyze that
problem
separately now the diagram which I have
drawn the question is that can we do the
same for other points yes we can do the
for the other points if you see for F1
I've only considered 36.5 but there are
other sets of points also which we gives
me and similar combinations are
available for F2 star double star star
so using this and this is three
dimensional one is easy for us to
understand we can consider different
problems accordingly thank you very much
and have a nice
day
