Note: Homework may be done in assigned teams and is aimed at preparing you for the individual in-class quizzes/exams. Students are advised to do as many problems in the class textbook as possible. The TA will be available to help you with the homework during TA office hours.

-----------------------------------------------------------------------------------------------------------

 Jan 18, 2005: Reading - Chapter 1-2 (Review).

                                  Chapter 3. Modeling

Jan 18, 2005: Preliminary Homework

Homework Set #1: Issue: Tues, Jan 25, 2005. Due: Thur, Feb 3, 2005.

        Chapter 3 Review Problems: 1, 2, 3, 4, 11, 12, 13, 15, 18, 33, 47, 56.

-----------------------------------------------------------------------------------------

Feb 8, 2005: Reading - Chapter 4 The Simplex Method

Homework Set #2: Issue: Tues, Feb 8, 2005. Due: Feb 18, 2005.

 Section 4.5 Max LPs: Page 149: 1, 2, 3, 4.

 Section 4.6 Min LPs: Page 151: 1, 2, 3, 4.

                          Issue: Tues, Feb 17, 2005. Due: Feb 24, 2005.

 Section 4.7 Alternative Optimal Solutions: Page 154 problems 1, 2, 3, 4.

 Section 4.8 Unbounded LPs: Page 158 problems 1, 2, 3, 4.

 Section 4.11 Degeneracy: Page 172 problems 1, 4, 5.

                        Issue: Tues, Feb 24, 2005. Due: March 1, 2005.

 Section 4.12 The Big M method:  Page 178  problems 1, 3.

 Section 4.13 The two-phase simplex method:  Use the two-phase simplex method

                   to solve problems 1 and 3 on page 178.

   Sample solutions to Problem 1 (Big-M)  and Problem 3 (2-Phase Simplex) on Page 178.

-----------------------------------------------------------------------------------------

Issue: Tues, Feb 25, 2005. Due: March 1, 2005.

Read the following article in the February issue of ORMS (Operations Research Management Science) Today:

Are Airlines Doing Their Homework? By Dr. Joseph C. Hartman

-----------------------------------------------------------------------------------------

Tues, March 7, 2005.

Reading - Chapter 6 Sensitivity Analysis and Duality

Homework Set #3: Issue: Tues, March 7, 2005. Due: March 29, 2005.

        Section 6.3 Sensitivity Analysis: Page 288  problem 1, 2, 3, 4, 5, 6.

        Section 6.5 Finding the Dual of an LP:  Page 301  problems 1, 2, 3, 4.

Note: This homework will be collected for grading and the score will

          contribute toward your individual quiz score!

-----------------------------------------------------------------------------------------

Issue: Thur, April 7, 2005,  Due: Tues, April 12, 2005.

 Reading: LINDO: Section 4.9 page 158

              LINGO: Section 410 page 163

              CPLEX (Interactive): See manual (lab or online) for commands

              EXCEL Section 4.17 page 202

Problem Solving: Solve Example 6 of Chapter 3 (Diet Problem) on page 69 and perform

 sensitivity analysis using the following software and compare the results: LINDO, LINGO, CPLEX and EXCEL.

Note: This homework will be collected for grading and the score will

           contribute toward your individual quiz score!

---------------------------------------------------------------------------------------

Thur, April 7, 2005.

Reading - Chapter 7 Transportation and Assignment Problems

Homework Set #4: Issue: Thurs, April 7, 2005. Due: Thurs, April 21, 2005.

        Complementary Slackness (Chapter 6): Page 349  problem 13, Page 352 problem 20.

        Transportation Problem (Transportation Simplex):  Page 371 problems 1, 2,

                 Page 382 problem 1(find an initial bfs for problems 1 and 2 only), Page 407  problem 1.

        Assignment Problem (Hungarian Method): Page 398 Problem 1, Page 408 problem 6.

Note: This homework will be collected for grading and the score will

           contribute toward your individual quiz score!

-----------------------------------------------------------------------------------------

Tues, April 19, 2005.

 Reading - Chapter 8 (Sections 8.1-8.3, 8.6) Network Models

Homework Set #5: Issue: Tues, April 19, 2004. Due: Thurs, April 28, 2004.

        8.2 Shortest Path  Problems (Dijkstra's algorithm):  Page 418  problem 2

        8.6 Minimum Spanning Tree Problems (MST algorithm)): Page 459 problem 2

        Optional (Extra Credit):

        8.3 Maximum Flow Problems  (Ford-Fulkerson Method): Page 430 problem 9

Note: This homework will be collected for grading and the score will

           contribute toward your individual quiz score!

-----------------------------------------------------------------------------------------

April 7, 2005.

Extra Practice Problems -- (Final solutions included!)

-----------------------------------------------------------------------------------

Send mail to ntaimo@tamu.edu with questions or comments about this web site.
Last modified: 03/31/05