2011-2012 2012-2013 2013-2014 2014-2015 2015-2016
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: MS&E 310: Linear Programming

MS&E 310: Linear Programming

Formulation of standard linear programming models. Theory of polyhedral convex sets, linear inequalities, alternative theorems, and duality. Variants of the simplex method and the state of art interior-point algorithms. Sensitivity analyses, economic interpretations, and primal-dual methods. Relaxations of harder optimization problems and recent convex conic linear programs. Applications include game equilibrium facility location. Prerequisite: MATH 113 or consent of instructor.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Ye, Y. (PI)
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints