MA 421

Mathematical Optimization, Applications, and Analysis

Mark Parker

Class: MW, 3:00 - 4:15, Simperman 123

Resources
Course Discussion Boards for assignments and other information Schedule of lessons and assignments Syllabus MS Word Document	INFORMS Resource Page operations research resource page from the Institute for Operations Research and Management Science Math Programming Glossary Dr. Harvey Greenberg's comprehensive guide to Math Programming Myths and Counterexamples in Math Programming Dr. Harvey Greenberg's collection of cool factoids

Introduction

We will explore mathematical modeling as it relates to optimization. Contrary to what you may believe from Calculus, optimization isn't always as simple as taking derivatives ( or partial derivatives) and finding the roots. We will explore

model building
boundary conditions
sensitivity analysis
exact vs. heuristic solutions

as we examine the idea of search, and how we can improve upon existing solutions by directed search. In particular, we will examine this idea of search in the area of mathematical programming - not to be confused with compute programming.

Throughout the semester, we will focus on understanding what type of problem we are trying to solve and how mathematics is used to solve the problem.

Text

Optimization in Operations Research,
First Edition

Ron Rardin

Prentice Hall

Grading

Your grade in the course will be determined entirely on your point total from projects - both individual and group. This grade will translate to a letter grade as follows :

A 90% or better
B 80% or better
C 70% or better
D 60% or better
F otherwise

mark parker

Last modified: 24 January 2004