This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: UF-ESI-63149/3/2007page 1 of 501-05.Solve the following problem graphically. (Recall, you should plot the feasible region, anddraw objective contours to figure out which way the objective is increasing.) Please show yourwork and not just the solution!minimize:f x y, ()2 x⋅y+:=Figure 1 -- Planar Region to ConstrainfLuther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435UF-ESI-63149/3/2007page 2 of 5subject to:4 x⋅y+12≤2 x⋅3 y⋅+18≤x2 y⋅+4≥x≥y≥The goal here involves confining the planar region to the values of x and y listed in the constraintsto create a feasible regionencompassing all areas of the plane within those constraints. Standardtextbooks define the feasible region for a linear program as the set of all points that satisfies all ofthe linear program's constraints and sign restrictions.Graph these constraints in Mathcad using appropriate transformations:y1x( )124 x⋅-:=y2x( )13182 x⋅-()⋅:=y3x( )124x-()⋅:=x0 10..:=Luther Setzer1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899(321) 544-7435UF-ESI-6314...
View Full Document
- Fall '09
- Optimization, Euclidean geometry, Intersection, Kennedy Space Center