Question

Solve the following LP model using the corner point method. Min 4X_1+5X_2 S.T. X_1+2X_2?80 3X_1+X_2?75 X_1,X_2?0...

Solve the following LP model using the corner point method.

Min 4X_1+5X_2

S.T. X_1+2X_2?80

3X_1+X_2?75

X_1,X_2?0

List all the corner points and provide the optimal solution for full credit.

Homework Answers

Answer #1

.Objective Function, Min(4x1+5x2)

S.T

x1+2x2 ?80 -----1

3x1+x2 ?75 ---2

x1?0 -----3

x2 ?0 ----4

Pint of Intersection of 1 & 2

x1+2x2 = 80 ---- 4

3x1+x2 = 75 ----5

2*e.q5- eq4

=> 5x1= 150-80 =70

=> x1 = 70/5 = 14

Putting x1 =14 in eq 5

x2 = 75-42 = 33

Point of intersection(14,33)

Point of intersection of other lines are

(0,40) ,(80,0) ,(0,75) & (25,0)

Graph

Corner Points in the feasibility area are

(0,75) , (14,33) and (0,80)

Put the corner points value in objective function

at (0,75)

4x1+5x2 = 4*0+5*75 = 375

At (14,33)

4x1+5x2 = 4*14+5*33 = 221

At (80,0)

4x1+5x2 = 4*80+5*0= 320

Minimum Value of objective function is at (14,33)

so , optimal solution is x1= 14 & x2 = 33

and Optimal Value = 221

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
Consider the following LP Min Z = 4X1+X2 s.t. 3X1+X2=3 4X1+3X2>=6 X1+X2<=4 X1 , X2 >=...
Consider the following LP Min Z = 4X1+X2 s.t. 3X1+X2=3 4X1+3X2>=6 X1+X2<=4 X1 , X2 >= 0 a) Put the problem into standard form, using slack, excess, and artificial variables. b) Identify the initial BV and NBV along with their values. c) Modify the objective function using an M, a large positive number. d) Apply the Big M method to find the optimal solution
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region. Using the corner points method, determine the optimal solution (s) (show your work). Maximize Z = 6.5x1 + 10x2 Subject to x1 + x2 ≤ 15 2x1 + 4x2 ≤ 40 x1 ≥ 8 x1, x2 ≥ 0 b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect does this have on the optimal solution? Are...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...
30r+45d 10r+15d≤1800 20r+25d≤2500 6r+15d≤1500 s.t. a) Use the Graphical Solution Method to solve the linear programming...
30r+45d 10r+15d≤1800 20r+25d≤2500 6r+15d≤1500 s.t. a) Use the Graphical Solution Method to solve the linear programming problem (label all functions, corner point points, and axis). r≥50 2d-1r ≥0 r,d≥0 or all variables non-negative
Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤...
Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤ 200 8A + 5B ≤ 80 A≥2 B≥5 Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z using enumeration method.
Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤...
Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤ 200 8A + 5B ≤ 80 A≥2 B≥5 Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z using iso-profit method.
Solve the following LP model using the dual simplex method. Use the format of the tabular...
Solve the following LP model using the dual simplex method. Use the format of the tabular form of the simplex without converting the problem into a maximization  problem.                                                 Minimize -2x1 – x2                                                 Subject to                                                                 x1+ x2+ x3 = 2                                                                 x1 + x4 = 1                                                                 x1, x2, x3, x4 ³ 0
Solve the following problem using dual simplex method: Min Z = 800X1 + 900X2 + 180X3,...
Solve the following problem using dual simplex method: Min Z = 800X1 + 900X2 + 180X3, s.t. 4X1 + 2X2 + X3 > 6, X1 + 3X3 > 5: x1, x2 , x3>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.
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Minimize Z = 2x1 + 3x2 Subject to             4x1 + 2x2 ≥ 20             2x1 + 6x2 ≥ 18               x1 + 2x2 ≤ 12 x1, x2  ≥ 0 with solution! thak you so much :D
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT