Lec 30 MIT 18.085 Computational Science and Engineering I
okay for lecture 30 uh which is you could say special cases of linear programming you could say special cases of integer programming but you got to say that word special because these are problems which fit where the answers the the the the the options are zero and one for the unknown X's so that in that way they're integer problems you a uh um we're looking at a zero or one marriages people are matched or they're not matched and usually integer programs are much harder than linear programs because uh the Simplex method for example for linear programs you you allowed all those fractions in between until you hit a corner and you didn't know whether that corner had integer values now it's true in the particular exam example I chose it turned out that the graduate student worked for 4 hours integer and the uh others worked for zero hours but uh the general linear program with ax equal B is not integer at all and we don't have to think about that w...