homework-2-solutions

homework-2-solutions - MthSc810 Mathematical Programming...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MthSc810 Mathematical Programming Fall 2011. Solutions to Homework #2. Exercise 1 Solve the following problem using the graphical method: min x 1 + 4 x 2 s.t. x 1 + 2 x 2 10 x 1 + x 2 6 x 1 x 2 2 x 2 . Then write the problem in standard form. Solution. The standard form requires one slack for each constraint and x 1 , uncon- strained in sign, has to be rewritten as x + 1 x 1 . min x + 1 x 1 + 4 x 2 s.t. x + 1 x 1 + 2 x 2 + x 3 = 10 x + 1 x 1 + x 2 x 4 = 6 x + 1 x 1 x 2 + x 5 = 2 x + 1 , x 1 , x 2 , x 3 , x 4 , x 5 . Exercise 2 Given two convex sets S 1 and S 2 in R n prove the following: S 1 S 2 is convex; A.: Trivial: for any two vectors x , y S 1 S 2 and any [0 , 1], x +(1 ) y S 1 and x +(1 ) y S 2 for convexity of S 1 and S 2 , and hence x +(1 ) y S 1 S 2 . S 1 S 2 = { x 1 + x 2 : x 1 S 1 , x 2 S 2 } is convex; A.: For any two vectors x , y S 1 S 2 and any [0 , 1], there certainly exist x S 1 and x S 2 such that x = x + x , and there exist y S 1 and y S 2 such that y = y + y . Then for any [0 , 1], x + (1 ) y = ( x + x ) + (1 )( y + y ) = x + (1 ) y + x + (1 ) y = u + v , where u = x + (1 ) y S 1 and v = x + (1 ) y S 2 for convexity of S 1 and S 2 , hence u + v...
View Full Document

Page1 / 3

homework-2-solutions - MthSc810 Mathematical Programming...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online