It's due to the sign change on the solution to constraint 2 meaning we need X1 to be greater than 23/12. Our feasible region is between 23/12 and 17/7.

The simplex method seems to be wrong. At 41:50 he should have taken out the first row of the second iteration instead of the one he's chosen. I did the example on Matlab and it returned a totally different result.

He solved the linear relaxation of the problem. Just ignore the constraints of x1 and x2 being integers and then solve the original problem with Simplex.

i could not find Gomory's all IPP…please tell me the lecture number. I need it urgently

start from 11:30 min for Example problem..

Can anyone explain from 21:35 min onwards, why he substituted x2 = 2 into the first constraint (7×1 – 5×2 = 7) and not the second?

You're my hero Prof. G. Srinivasan

It's due to the sign change on the solution to constraint 2 meaning we need X1 to be greater than 23/12. Our feasible region is between 23/12 and 17/7.

Since we're maximizing, we want to choose 17/7

any one tell me at what circumstances we have unfeasible in this vdeo problem.

what calculations we have that we have unfeasivle node like in given problem senerio

The simplex method seems to be wrong. At 41:50 he should have taken out the first row of the second iteration instead of the one he's chosen. I did the example on Matlab and it returned a totally different result.

negative pivot element is not allowed i guess..hence he chose 2nd row!

the cutting plane algorithm is also called gomor's algo..

check the nxt video..

where did he found the value for x1* and x2* when first solving the integer programming function?

05:15 is Fail

He solved the linear relaxation of the problem. Just ignore the constraints of x1 and x2 being integers and then solve the original problem with Simplex.

he forgot in between…..

is there any video explaining replacement problems. plz send link here in cmnt box.

thanks a lot. i would have failed without this video. :p proud to be a NITTian lol

Thanks a lot

I would like to thanks all iit lecturers and Indian Government for putting such nice lectures..

@24:36 when x1=2, x2=2.06 not 2. What is going on?

Lecture should be named as branch and bound instead of bond as that would make searching criteria easier on You tube.

Godlike

I don't understand how the size of the constraint set doesn't increase on adding a constraint in branch and bound technique

His handwriting is unmatched