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 | 11:00-12:20pm | Mon, Wed | 16 of 35 | Jong-Shi Pang | OHE100C | PDF (111147 KB) |   |
| 31736D | 034 | Lecture | 11:00-12:20pm | Mon, Wed | 4 of 10 | Jong-Shi Pang | DEN@Viterbi | PDF (111147 KB) | |