Chapter 2 Practice Problems

# Chapter 2 Practice Problems - Chapter 2 Practice Problems...

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Chapter 2 Practice Problems 20) 21) maximize Z = 5x1 + 8x2 + 0s1 + 0s3 + 0s4 subject to: 3x1 + 5x2 + s1 = 50 2x1 + 4x2 + s2 = 40 x1 + s3 = 8 x2 + s4 = 10 x1, x2 0 A: s1 = 0, s2 = 0, s3 = 8, s4 = 0 B: s1 = 0, s2 = 3.2, s3 = 0, s4 = 4.8 C: s1 = 26, s2 = 24, s3 = 0, s4 = 10 29) 30) The problem becomes infeasible 31) 36) Let x1 = hours to operate mine 1 x2 = hours to operate mine 2 minimize Z = 200x1 + 160x2 subject to 6x1 + 2x2 12 (highgrade ore, tons) 2x1 + 2x2 8 (mediumgrade ore, tons) 4x1 + 12x2 24 (lowgrade ore, tons) x1,x2 0 50) Let s = number of instate students accepted n = number of outofstate students accepted Maximize Z = \$7,600s + 22,500n subject to s + n 3,500 .4s + .6n 0 .12s + .24n 600 s, n 0 Optimal solution: Intersection of the 40% out of state and 3500 max students constraints: .4s + .6n <= 0 s + n <= 3500 s=2100, n=1400 7600(2100) + 22500(1400) = 47,460,000 ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online