1 / 9

Exam #3 – Apr 21 - Everybody

Exam #3 – Apr 21 - Everybody. Open Book, Open Notes You can use a calculator and a straight edge You can not use a computer Covers: Lectures 9 thru 24 HWs 6, 7, 8, 9, 10 Chapters 5, 6, 7,9, 10, 11, 12 (skip Ch 8). Exam #3 - Review. Topics: AMPL Modeling Language

enye
Download Presentation

Exam #3 – Apr 21 - Everybody

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Exam #3 – Apr 21 - Everybody • Open Book, Open Notes • You can use a calculator and a straight edge • You can not use a computer • Covers: • Lectures 9 thru 24 • HWs 6, 7, 8, 9, 10 • Chapters 5, 6, 7,9, 10, 11, 12 (skip Ch 8)

  2. Exam #3 - Review • Topics: • AMPL Modeling Language • Chapter 5: Primal Simplex Algorithm • Basic Solutions • Basic Feasible Solutions • Two Phase Simplex Algorithm – p.213 • Phase 1 Outcomes • Artificial > 0 implies infeasible • Artificials = 0 implies go to Phase 2 • Phase 2 Outcomes • Unbounded • Optimal

  3. Exam #3 - Review • Topics: • Basis Inverse Update p. 230 • Bn+1-1 = EBn-1 • Alg 5D: Lower-And-Upper Bounded Revised Simplex • p. 244 • Chapter 6: Interior Point Algorithm • Know how to do the projection • P = (I-A’(AA’)-1A)

  4. Exam #3 - Review • Topics: • Chapter 7: Duality and Sensitivity • Relaxation • Dual Problems • Economic Interpretation of Dual Variables • Optimal Objective Values Match • Complementary Slackness • Table 7.1

  5. Exam #3 - Review • Topics: • Chapter 9: Shortest Paths • Alg 9C page 440 • Chapter 10: Minimum Cost Network Flow Problem • Node-Arc Incidence Matrix • Flow Conservation Is Preserved When Flow Is Changed In Cycles • Alg 10A page 495

  6. Exam #3 - Review • Topics: • Special Cases • Transportation Problem • Assignment Problem • Shortest Path Problem • Maximal Flow Problem • Algorithm 10B on page 527 • Fixed Charges • Knapsack Problem

  7. Exam #3 - Review • Topics: • Discrete Optimization • Knapsack Problem • Modeling Using Binary Variables • NASA Example • Set Covering Constraints > 1 • Set Packing Constraints < 1 • Set Partitioning Constraints = 1 • Crew Scheduling For American Airlines • Traveling Salesman Problem • Facility Location Problem

  8. Exam #3 - Review • Topics: • Surplus Food Distribution Center Location Problem • Telecom Design Problem – Fixed Charge Problem • LB-Based Branch-And-Bound • Depth-First Search • Lower Bounds • Upper Bounds • Optimality Gap • Incumbent

  9. Exam #3 - Review • Topics: • LB-Based Branch-And-Bound • Fathoming • Branching • Example Of Cameras To Cover Roads • Example Of Pipe Line Design Problem

More Related