01:640:453 - Theory of Linear Optimization
Topics include convex sets, polyhedra, Farkas lemma, canonical forms, simplex algorithm, duality theory, revised simplex method, primal-dual methods, complementary slackness theorem, maximal flows, transportation problems, and 2-person games.
Students will have the chance to apply the methods to real-life problems. One of the aims of the course will be to teach the students the path from real-life problems to abstraction, to mathematical formulation, to solving the mathematical problem, to applying the solution in the real-life framework.
Prerequisite: 01:640:250 Introductory Linear Algebra
Textbook: For current textbook please refer to our Master Textbook List page
Text may vary by instructor.
Schedule of Sections
Disclaimer: Posted for informational purposes only
This material is posted by the faculty of the Mathematics Department at Rutgers New Brunswick for informational purposes. While we try to maintain it, information may not be current or may not apply to individual sections. The authority for content, textbook, syllabus, and grading policy lies with the current instructor.
Information posted prior to the beginning of the semester is frequently tentative, or based on previous semesters. Textbooks should not be purchased until confirmed with the instructor. For generally reliable textbook information—with the exception of sections with an alphabetic code like H1 or T1, and topics courses (197,395,495)—see the textbook list.