Csci 628

Linear Programming

Fall 2007

Assignment 1: Three formulations distributed in class. (Due Monday, Sept. 3)

Assignment 2: Problems 2.1, 2.3, 2.6, 2.7, 2.9, 2.12, 2.14. (Due Wednesday, Sept. 12)

Assignment 3: Problems 3.2, 3.5, 3.6, 3.7, 4.1, 4.3, 4.4 (Due Wednesday, Sept. 19)

Assignment 4: Problems 4.5, 4.6, 5.1, 5.2, 5.5 and 2.18 (Due Wednesday, Sept. 26)

Assignment 5: Problems 5.10, 5.11, 6.1, 6.2, and 6.3 (Due Wednesday, Oct. 3)

Assignment 6: Problems 7.1, 7.3, 7.5, 8.1, and 8.2 (Due by noon on Friday, Oct. 12)

Assignment 7: Ampl diet problem (Due Oct. 31).

Assignment 8: LP school busing case (Due Nov. 7).

Assignment 9: Problems 13.1, 13.4, 13.7, 13.10, 14.1 and 14.4 (Due Nov. 14). For 14.1 number the nodes on the left from 1 to 4 and the nodes on the right a to c. Don't use 14.2 as the initial spanning tree solution. Instead, use edges (1a, 2a, 2b, 2c, 3b, and 4c).

HOMEWORK POLICY. Regular homework emphasizing and extending lecture material will be assigned and graded. Late homeworks are not accepted except in the case of an unanticipatable absence (e.g. serious illness, death in the family, loss of your favorite dvd etc.).

Back to Professor Kincaid's Home Page