This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CO 350 Assignment 2 – Winter 2010 Due: Friday January 22 at 10:25 a.m. Solutions are due in drop box #9 (Section 1) or #10 (Section 2), outside MC 4066 by the due time. Use the appropriate slot for your section and surname. Please acknowledge all outside sources, as well as all collaboration, discussion, help, etc., in your submission. 0. Begin your assignment with the following: Last Name: (Print your last name.) First Name: (Print your “official” first name. No nicknames.) ID: (Print your UW student ID) Section: (Print your section number) Acknowledgments: 1. Consider the following linear programming problem ( P ): min 2 x 1 + x 2 + 3 x 3 subj. to 3 x 1 + 2 x 2 = 10 x 2 + 2 x 3 ≥ 8 2 x 1 + x 2 x 3 ≤ 8 x 1 ≥ x 2 ≤ (a) Convert ( P ) into standard inequality form. Denote the LP problem after the transfor mation by ( P ). (b) Convert ( P ) into standard equality form. Denote the LP problem after the transformation by ( P 00 )....
View
Full Document
 Fall '10
 GUENIN
 Operations Research, Optimization, linear programming problem, LP problem

Click to edit the document details