Answer:
X = 3.50
Y = 1.25
Optimal Solution = 3.50*8 + 1.25* 6 = 35.50
Explanation:
Both constrains are less than constrains so feasible region is the quadrilateral bounded by both axis and both lines of constrain.
Four Corner points are:
P1) (4,0) - Intersection of C2 and X-axis
Profit = 4*8 + 0*6 = 32
P2) (0,3) - Intersection of C1 and Y-axis
Profit = 0*8 + 3*6 = 18
P3) (0,0)- Origin point
Profit = 0
P4) (3.50, 1.25) - Intersection of C1 & C2
Profit = 3.50*8 + 1.25*6 = 35.50
Intersection of C1 & C2
by solving both equation:
1x + 2y = 6
5x + 2y = 20
C2 -C1 :
4x = 14
X =14/4 = 3.50
Put value of X in C1
2Y = 6 - 3.50
Y = 2.50/2 = 1.25
P4: (X,Y) = (3.50,1.25)
L.P. Model: 20- Maximize Subject to: 18- Z= 2X + 8Y 1X + 2Y = 6 5X + 1 Y = 20 X,Y 20 (C1) (C2) 16- 14- On the graph on right, the constraints C, and Cy have been plotted. 12- Using the point drawing tool, plot the four corner points for the feasible area. 10- 8- 6- 4- 2- 0- 0 2 4 6 00- 12 14 16 00 20 10 X
Consider Paul Jordan's following linear programming formulation: Minimize $ 4$4Upper X 1X1plus+ $ 2$2Upper X 2X2 11Upper X 1X1plus+ 33Upper X 2X2 greater than or equals≥ 7575 (Upper C 1C1 ) 88Upper X 1X1plus+ 22Upper X 2X2 greater than or equals≥ 160160 (Upper C 2C2 ) 33Upper X 1X1plus+ 22Upper X 2X2 greater than or equals≥ 120120 (Upper C 3C3 ) 11Upper X 2X2 less than or equals≤ 7070 (Upper C 4C4 ) Upper X 1X1 , Upper X 2X2greater...
Solve the following linear programming problem graphically: Maximize Z=4X₁+4X₂, Subject to: 3X₁ + 5X₂ ≤ 150 X₁ - 2X₂ ≤ 10 5X₁ + 3X₂ ≤ 150 X₁, X₂ ≥ 0 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints. 2) Using the point drawing tool, plot the five corner points which define the feasible region. The optimal solution is X₁ = _______ and X₂ = _______ (round your responses to two decimal places). Maximum profit is $_______
Maximize and minimize p = 2x − y subject to x + y ≥ 1 x − y ≤ 1
x − y ≥ −1 x ≤ 7, y ≤ 7.
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT (See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Maximize and minimize p = 2x - y subject...
Need optimal solution for x,y, and value Z
The Attaran Corporation manufactures two electrical products: portable air conditioners and portable heaters. The assembly process for each is similar in that both require a certain amount of wiring and drilling. Each air conditioner takes 3 hours of wiring and 2 hours of drilling. Each heater must go through 2 hours of wiring and 1 hour of drilling During the next production period, 240 hours of wiring time are available and up...
I dont know how they got the numbers. I tried different methods
and still didnt get the right answer.
Doug Turner Food Processors wishes to introduce a new brand of dog biscuits composed of chicken and liver flavored biscuits that meet certain nutritional requirements. The liver flavored biscuits contain 1 unit of nutrient A and 2 units of nutrient B; the chicken flavored biscuits contain 1 unit of nutrient A and 4 units of nutrient B. According to federal requirements,...
Use graphical methods to solve the following linear programming problem. Maximize: z= 3x + y subject to: x-ys7 3x + 5y = 45 X20, y20 Graph the feasible region using the graphing tool to the right. Click to enlarge graph , at the corner point The maximum value of z is (Simplify your answers.) of T o to 12 14 16
Q3. (a) Solve the following LP model GRAPHICALLY by drawing a specific objective function iso- cost line) and show the feasible area. Minimize Cost $28X + $24Y s.t. (1) 5X + 4Y S 2600 (2)X + Y 2 300 (3) X 2 80 (4) Y 2 100 X,Y 20 (b) Find the optimal solution and calculate the optimal (minimum) value). SHOW YOUR WORK Q4. (Based on the information from Q3 solved above) (a) WRITE below the STANDARD FORM of Q1...
3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions: Basic variables = (X1,X3.Xp). Inverse = | 0 0 0 0 1
3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions:...
3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions: Basic variables = (X1,X3.Xp). Inverse = | 0 0 0 0 1
3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions:...