View the step-by-step solution to:

# LINEAR PROGRAMMING PROBLEM: MAX 25X1+30X2+15X3 S. 1)4X1+5X2+8X3<1200 2)9X1+15X2+3X3<1500 OPTIMAL SOLUTION: Objective Function Value =4700.000...

LINEAR PROGRAMMING PROBLEM:

MAX 25X1+30X2+15X3

S.T.

1) 4X1+5X2+8X3<1200

2) 9X1+15X2+3X3<1500

OPTIMAL SOLUTION:

Objective Function Value =         4700.000

Variable Value Reduced Costs

X1 140.000 0.000

X2 0.000 10.000

X3 80.000 0.000

Constraint Slack/Surplus Dual Prices

1 0.000 1.000

2 0.000 2.333

OBJECTIVE COEFFICIENT RANGES:

Variable Lower Limit Current Value Upper Limit

X1 19.286 25.000 45.000

X2 no lower limit 30.000 40.000

X3 8.333 15.000 50.000

RIGHT HAND SIDE RANGES

Constraint Lower Limit Current Value Upper Limit

1 666.667 1200.000 4000.000

2 450.000 1500.000 2700.000

a.   Give the complete optimal solution.

b.   Give the reduced costs? Explain fully its meaning.

c.   What is the dual price for the second constraint? What interpretation does this have?

d.  Over what range can the objective function coefficient of x2 vary before a new solution point becomes optimal?

e.   By how much can the amount of resource 2 decrease before the dual price will change?

f. Which constraint(s) have a surplus ?Explain

f. Which constraint(s) have a slack ? Explain

Each value is less than the right side of the less than or equal to sign

g. Can this problem be solved using the graphical method?

h. What does the objective function value represent? (Give the breakdown to show how x1, x2 and x3 contribute to the objective function value).

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents
• ### -

Question & Answers

Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

Ask a Question