E102 Introduction to Operations Research
Fall 2001
Homeworks


            Buying a house case (pg 38)
            Ex 1.5  (pg 46)
 
              Ex 2.1, 2.4, 2.9, 2.15, 2.17
            Ex 3.2
 
              Ex 2.21, 2.24, 2.30
 
              Ex 3.6, 3.9, 3.20
              Ex 4.3, 4.4, 4.8
            Case module on "scallop sampling" on pages 185-189.
              Ex 6.2, 6.3, 6.4
              Ex 7.1, 7.2, 7.8, 7.10
 
             Ex 9.2, 9.3, 9.6, 9.7,

          Solve the following problems with branch-and-bound:

            1) max  2x1 + 3x2
                   s.t.   x1 + 2x2 <= 10
                         3x1 + 4x2 <= 25
                             x1, x2 >=0, integer
 

            2) max  5x1 + 8x2 + 3x3 + 7x4
                   s.t.  3x1 + 5x2 + 2x3 + 4x4 <= 6
                               x1,x2 = {0,1}