This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MthSc 810 Mathematical Programming Final exam. Due Tuesday, December 13, 6pm EST. Full name braceleftbigg Signature braceleftbigg You have seven days and seven problems. This exam accounts for 25% of the final grade. There are 105 points. Please write clear and concise statements. Explain all your answers. Use a readable handwriting: un readable answers will be given no points. Turn in your final exam stapled with this first page bearing your name and signature. This is an exam, therefore you must work on your own . For more information, check http://www.clemson.edu/academics/academicintegrity . Problem 1 (5 pts.): 1. Prove that the set S = { ( x 1 ,x 2 ) : x 1 x 2 1 ,x 1 > ,x 2 > } is convex. 2. Prove that the set G = { R + : 1 min { x : x 1 }} is convex. Problem 2 (15 pts.): Consider the problem min 3 x 1 + x 2 s.t. x 1 x 2 x 3 = 1 2 x 1 x 2 + x 4 = 4 x 1 , x 2 , x 3 , x 4 . 1. The basis B = { 2 , 4 } is neither primal nor dual feasible. However, there is one pivoting operation that suffices to obtain a basis that is either primal...
View
Full
Document
This note was uploaded on 03/14/2012 for the course MTHSC 810 taught by Professor Staff during the Fall '08 term at Clemson.
 Fall '08
 Staff
 Math

Click to edit the document details