Computer Science 536:
Linear Programming and Extensions (3.0 units)
Linear programming models for resource allocation; simplex and revised simplex methods; duality; sensitivity; transportation problems; selected extensions to large scale, multiobjective, and special structured models.
- Prerequisite: 1 from (EE 441 or MATH 225)
- Crosslist: This course is offered by the ISE department but may qualify for major credit in CSCI. To register, enroll in ISE 536.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 31536D | 048 | Lecture | 6:40-9:20pm | Monday | 35 of 40 | Sima Parisay | OHE100B | Word (120320 KB) |   |
| 31736D | 034 | Lecture | 6:40-9:20pm | Monday | 5 of 5 | Sima Parisay | DEN@Viterbi | PDF (227954 KB) | |