Question 2. we formulated differently in last lecture [Lec-9]. All constraints you have given as X1 + X2 +n1 -P1 =30 Y1 +Y2 + n2 - P2 =40 4X1 + 3Y1 + n3 -P3 =90 4X2 + 3Y2 + n4 - P4 = 20 7X1 + 6X2 + 8Y1 + 7Y2 +n5 -P5 =200 but you have taken different constrains here [Lec10] in this lecture. Can you please explain clearly which one is correct?
sir, how to identify rigid constraints when only formulated problem is given and thats too in weigted goal programming form..... for example: Min Z = P1n1+P2p4+5P3n2+3P3n3+P4p1 sub to X1 + X2 + n1 - p1 = 80 X1 + n2 = 70 X2 + n3 = 45 p1 + n4 - p4 = 10 all X, p, n > or = zero is this problem can be solve only by graphical? Can objective function can be written as : minimise [ n1, p4, n2, n3, p1 ] please help me out THANK YOU
In the days of computers, why one has to solve it on black board with simplex? Rather students should learn how to model complex situations in Goal Programming.
Question 2. we formulated differently in last lecture [Lec-9]. All constraints you have given as
X1 + X2 +n1 -P1 =30
Y1 +Y2 + n2 - P2 =40
4X1 + 3Y1 + n3 -P3 =90
4X2 + 3Y2 + n4 - P4 = 20
7X1 + 6X2 + 8Y1 + 7Y2 +n5 -P5 =200
but you have taken different constrains here [Lec10] in this lecture.
Can you please explain clearly which one is correct?
sir, how to identify rigid constraints when only formulated problem is given and thats too in weigted goal programming form..... for example:
Min Z = P1n1+P2p4+5P3n2+3P3n3+P4p1
sub to
X1 + X2 + n1 - p1 = 80
X1 + n2 = 70
X2 + n3 = 45
p1 + n4 - p4 = 10
all X, p, n > or = zero
is this problem can be solve only by graphical?
Can objective function can be written as :
minimise [ n1, p4, n2, n3, p1 ]
please help me out
THANK YOU
If you are writing directly by seeing paper how we can understand?
things are bit confusing
In the days of computers, why one has to solve it on black board with simplex? Rather students should learn how to model complex situations in Goal Programming.
Because lecturers usually wants the students to solve these problems with simplex :\