Question

Solve the following LP problem graphically using level curves. MAX: 7 X1 + 4 X2 Subject...

Solve the following LP problem graphically using level curves.

MAX: 7 X1 + 4 X2
Subject to: 2X1 + X2 ≤ 16
X1 + X2 ≤ 10
2X1 + 5 X2 ≤ 40
X1, X2 ≥ 0

a. X1 = 4
b. X1 = 6
c. X1 = 8
d. X1 = 10

Homework Answers

Answer #1

option 2

X1=6

------------------

Placing each of the constraints in the graph

to place it we need to make it perfect inequalities and then using zero equal to one variable we can calculate the point for an axis

Like,

for the first constraint

2x1+x2=16

x2=0

2x1=16

x1=8 then the point on the y-axis is (8,0)

x1=0

x2=16 then the point on the x-axis is (0,16)

and so on

Placing this point and joining lines then shading the area lower which is inequalities showing

for positive inequalities (X1 and X2 greater than zero), the solution should be positive quadrant

from the graph the solution is at X1=6 and X2 =4

solution of LPP is

7X1+4X2

7*6+4*4

=58

the solution is 58

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Solve the following LP problem graphically; confirm your results using Solver in MS Excel. Maximize profit...
Solve the following LP problem graphically; confirm your results using Solver in MS Excel. Maximize profit = 20x1 + 10x2 Subject to: 5x1 + 4x2 ≤ 250 2x1 + 5x2 ≤ 150 x1, x2 ≥ 0
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3=...
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3= 1 2X1+ X2≤3 X2, X3 ≥0, X1 urs a) Find the standard form of the LP problem. b) Find the starting tableau to solve the Primal LP problem by using the M-Technique.
Find the duals of the following LP: max z = 4x1 - x2 + 2x3 s.t....
Find the duals of the following LP: max z = 4x1 - x2 + 2x3 s.t. x1 + x2 <= 5 2x1 + x2 <= 7 2x2 + x3 >= 6 x1 + x3 = 4 x1 >=0, x2, x3 urs show steps
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤...
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤ 80 5X1 + 2X2 ≤ 80 X1≥ 0 , X2≥0
Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤...
Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤ 80 2X1 + 3X2 ≤ 70 X1≥ 0 , X2≥0
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1...
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1 - x2 + 3x3 ≤   4             2x1 + x2           ≤ 10             x1 - x2 -    x3 ≤   7 and       x1 ≥ 0,   x2 ≥ 0,    x3 ≥ 0. Use Excel Solver to solve this problem. Write out the augmented form of this problem by introducing slack variables. Work through the simplex method step by step in tabular form to solve the problem.
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2...
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2 ≥ 10 x1 – x2 = 4 0.5x1 + 2x2 ≤ 20 x1 ≥ 0, x2 unconstrained Please provide an excel solution to this problem
Solve The LP problem using the graphic method Z Max=6X1+5X2 Constaint function: X1 + 2X2 ≤...
Solve The LP problem using the graphic method Z Max=6X1+5X2 Constaint function: X1 + 2X2 ≤ 240 3X1 + 2X2 ≤ 300 X1≥ 0 , X2≥0
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject...
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject to 2x1 – 6x2 ≤ 12 5x1 + 4x2 ≥ 40 x1 +2x2 ≥ 12 x2 ≤ 6 x1, x2 ≥ 0
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual...
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual model b.) Given the information that the optimal basic variables are X1 and X3, determine the associated optimal dual solution.