This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: y = a x + b which minimizes the sum of absolute deviations of each observed value of y i from it’s predicted value a x i + b . (b) Modify the formulation in part (a) to minimize the maximum absolute deviation over all observed values y i from it’s predicted value a x i + b . 5. Consider the polyhedron P = { x ∈ R 2  x 1 ≥ ,x 2 ≥ , a i x ≥ b i ,i = 1 , 2 , 3 , 4 } (shaded region), where each line L i is deﬁned by a i x = b i , i = 1 , 2 , 3 , 4. For each of the vectors represented by points A,B,C,D,E and F , determine (a) if it represents a feasible solution; (b) all active constraints at this point; (c) its rank. Conclude which vectors are basic feasible solutions. x 1 x 2 A O B C D E F L 4 L 3 L 2 L 1 2...
View
Full
Document
This note was uploaded on 12/02/2011 for the course MATH 3252 taught by Professor Tanbanpin during the Spring '10 term at National University of Singapore.
 Spring '10
 TanBanPin
 Linear Programming

Click to edit the document details