Business Homework Solutions
Problem
#68984

Linear programming problem: minimization

Consider the following minimization problem.

Min z = 1.5x1 + 2x2
s.t. x1 + x2      300
2x1 + x2     400
2x1 + 5x2   750
       x1, x2   0

What are the optimal values of x1, x2, and z?  


Solution Summary

This solution provides details on how to solve a minimization problem for a linear programming situation.

Solution
What is this?
By OTA - Overall OTA Rating
Jai Advani, PhD  - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
  • Plain text response
  • Attached file(s):
    • Solution_Linear Program.xls
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
Browse