Unformatted text preview: t = 0. You were also supposed to show why the ﬁrst two deﬁnitions were true, but many of you forgot to do that. Please look at the solution. Q5 [(a) 5 marks; (b) 5 marks]: Many students still have problems running the simplex method. Some got confused about the term ‘iteration’, while others seem to think that variables with negative reduced cost may enter the basis. At this stage of the course, not understanding the simplex method is a serious problem. You should master this method! Q6 [10 marks]: Some students are having problems on choosing the leaving variable, which is the heart of the perturbation method. Review your course notes thoroughly. 1...
View
Full Document
 Winter '07
 S.Furino,B.Guenin
 Linear Programming, ObjectOriented Programming, Optimization, Simplex algorithm, George Dantzig

Click to edit the document details