Math 171B (Mathematical Programming)

Course Topics: Numerical methods for nonlinear optimization
Instructor: Prof. Michael Holst (5739 AP&M, mholst@math.ucsd.edu; Office Hours: MW 1-2pm)
TA: Beate Winkelmann (5760 AP&M, bmwinkelmann@ucsd.edu)
Term: Spring 2003
Lecture: 9:00a-9:50a MWF, WLH 2209; Discussion: 9:00a-9:50a Th, U413A 2
Textbook(s): P.E. Gill and M.H. Wright, NUMERICAL OPTIMIZATION, Available at Soft Reserves.
Main class webpage: http://ccom.ucsd.edu/~mholst/teaching/ucsd/171b_s03/index.html
Homework webpage: http://172.16.145.224/mholst/171b_s03/index.html

CATALOG DESCRIPTION: 171A-B. Mathematical Programming/Numerical Optimization (4-4)
Mathematical optimization and applications. Linear programming, the simplex method, duality. Nonlinear programming, Kuhn-Tucker theorem. Selected topics from integer programming, network flows, transportation problems, inventory problems, and other applications. Three lectures, one recitation. Prerequisites: Math. 20F and knowledge of programming.

COURSE INFORMATION: Problems in all areas of mathematics, science, and engineering can be posed as optimization problems. An optimization problem begins with a set of independent variables or parameters, and often includes a set of side conditions which define acceptable values of the variables for the particular application. These side conditions are known as constraints. The second component of an optimization problem is a measure of goodness called the objective function, which depends in some way on the constrained variables. The solution of an optimization problem is a (possibly non-unique) set of allowed values of the independent variables for which the objective function reaches its "optimal" (maximal or minimal) value. While Math 171A dealt mainly with linear programming, Math 171B deals mainly with nonlinear programming. This involves the minimization of a nonlinear objective function, possibly subject to nonlinear constraints in the form of equalities or inequalities. For historical reasons, this subject area is often called mathematical programming. The modern terminology for this subject is simply optimization, and the numerical algorithms we study form the subject of numerical optimization.
LECTURES AND HOMEWORKS: The lectures topics and the corresponding homeworks problems (a combination of theory problems and computer problems) are posted at the bottom of the class webpage (listed above). The problem sets are sometimes updated for various reasons, so you should assume that the list may be subject to change. You should read the relevant sections in the text before the lectures in order to get the most from the lectures. The lectures will highlight the important parts of the material, but there will not be time in lecture to cover all of the material in each section in detail. Therefore, having access to, and reading, the textbook is an important component of the course.
GRADES, EXAMS, DATES: Your scores on the theory and computer homeworks form 20% of your grade. The remainder of your grade will be calculated from your performance on two midterm exams and one final exam, to be given on the dates below.

EXAM DATES:

• Midterm 1: Friday April 25, in class. (Covers Chapters 1 and 2; 20% of grade.)
• Midterm 2: Friday May 23, in class. (Covers Chapter 3; 20% of grade.)
• Final: Monday June 9, 8am-11am, WLH 2209. (Cummulative and Chapter 4, i.e. Chapters 1-4; 40% of grade.)
OTHER IMPORTANT DATES:
• First lecture: Monday, March 31
• Last lecture: Friday, June 6
• Finals week: Mon-Fri, June 9-13
• Holiday: Monday, May 26 (Memorial Day -- NO LECTURE)