Operations Research

MATH 333, Spring Semester, 2017


To the Bottom of the Page


Instructor: †† Dr. Shieu-Hong Lin†† LinEmail

Class time: †††† MW†††† 10:30-11:45pm at Grove 4B

Office Hours: M~Th8:30-10:30 am


Syllabus: compact version

Books and references

       Prajit K. Dutta. Strategies and Games: Theory and Practice. MIT Press, 1999. (Required textbook)

       Robert Fourer, David M. Gay, and Brian W. Kernighan. AMPL: A Modeling Language for Mathematical Programming (online)

       R. Vanderbei. Linear Programming: Foundations and Extensions, 2nd ed.  Springer 2001.

       Online service for mathematical programming using AMPL



About the reading reports:

     Effort (2 points): How much time have you spent in the reading? What percentage of the contents in the reading do you think you understand? Have you come to the class this week?  Assessment: The student is expected to (i) have attended the class this week at least once (0.5 point), and(ii) have either gained a good understanding of 80% or more of the contents or have spent at least three hours in the reading (1.5 points).

     Reflection on the reading (2 points): Put down 1~2 paragraphs of your thoughts such as notes of new insight you gained, interesting things encountered, questions of things you donít understand,  and so forth.  Assessment: the student is expected to show substantial evidence of understanding or effort of trying to understand the contents in the reading.




Week 1: Introduction to Mathematical Programming and AMPL: Production Models


Showcase 1: Optimization Problems for Vehicle Refueling Planning

Showcase 2: Mechanism of a Bidding Game: Design and Analysis


Enter your report online under Canvas according to this format.





Week 2: More on Linear Programming Using AMPL: Diet Models



       Explore the continuous knapsack problem and see an example in 1 about how we can solve the problem efficiently. As discussed 02/06 in the class, the optimization problem in the production domain depicted in Chapter 1 of the AMPL book can be viewed and efficiently solved as the continuous knapsack problem without using linear programming. Please reflect on how this and describe how this can be done in your report.

       Show in your report how you can apply your understanding of the continuous knapsack problem above to solve the production domain case depicted in the AMPL sample code on P.5 of Chapter 1 without using linear programming.







Week 3: More on Linear Programming Using AMPL: Transportation and Assignment Models






Power point class notes available under Files in our Canvas class site.


TA:William Tan.TA hours in MATH lab: Monday/Wednesday 2:00~3:00pm




To the Top of the Page