This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CO 350 Assignment 2 – Winter 2009 Due: Friday January 23 at 10 a.m. Solutions are due in drop box #2 , outside MC 4066 by the due time: Slot #9 (A-F), Slot #10 (G-L), Slot #11 (M-R), Slot #12 (S-Z). Please acknowledge all outside help and collaboration in your submission. Write your name, ID# and Section# clearly: Section 1: J. Cheriyan, TTh 10-11:20 a.m. Section 2: E. Teske, MWF 10:30-11:20 a.m. Policy for marking complaints : If you have any complaints about the marking of assignments or the midterm exam, then you should first check your solutions against the posted solutions. After that, if you see any marking error, then you should return the assignment (or exam) to your instructor within one week and with written notes on all the marking errors; you may write the notes on the first/last page or else attach a separate sheet. ( ⋆ ) Reading : Read Chapters 2, 3, and 4.1, 4.2, before attempting the exercises. ( ⋆ ) Note : Some of the questions ask you to find a feasible solution or an optimal solution to an LP problem. Use ad-hoc methods in this assignment. Later on, we will study better methods in Chapters 4 and 6. 1. This question addresses mathematical programming problems (abbreviated MP problems) that are generalizations of LP problems, where we may have any function (rather than a linear function) in the objective function as well as in the constraints, and moreover, we allow strict...
View Full Document
- Spring '07
- Optimization, optimal solution, J. Cheriyan