This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 , x 2 0 (b) 2 MAT540 Example Problem Solutions 13.(a) x 1 = # necklaces x 2 = # bracelets maximize Z = 300x 1 + 400x 2 (profit, $) subject to: 3x 1 + 2x 2 18 (gold, oz) 2x 1 + 4x 2 20 (platinum, oz) x 2 4 (demand, bracelets) x 1 , x 2 0 3 MAT540 Example Problem Solutions 36. (a) x 1 = # of hours mine 1 x 2 = # of hours mine 2 minimize Z = 200x 1 + 160x 2 (cost, $) subject to 6x 1 + 2x 2 12 (high grade ore, tons) 2x 1 + 2x 2 8 (medium grade ore, tons) 4x 1 + 12x 2 24 (low grade ore, tons) x 1 , x 2 0 4...
View
Full
Document
 Spring '10
 AZAD
 Linear Programming

Click to edit the document details