Mathematics Department - Math 453 - Theory of Linear Optimization

Math 453 - Theory of Linear Optimization

General Information

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


Mokhtar S. Bazaraa, John J. Jarvis, and Hanif D. Sherali;
Linear Programming and Network Flows (4th edition); Wiley (text) 2009 (768 pp.);
ISBN: 978-0-470-46272-0

Current semester: Fall 2014

Text may vary by instructor.

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.

This page was last updated on March 30, 2017 at 10:53 pm and is maintained by
For questions regarding courses and/or special permission, please contact
For questions or comments about this site, please contact
© 2018 Rutgers, The State University of New Jersey. All rights reserved.