Chapter 15 Part 2

# Chapter 15 Part 2 - Chapter 15 Goal Programming Part 2 Goal...

This preview shows pages 1–6. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: Chapter 15 Goal Programming Part 2 Goal Programming Priorities Different levels for goals that give relative importance to the various goals (in addition to weights) P1 Represents highest priority P2 Represents next highest priority; satisfied next as long as there is no reduction in the achievement of P1 goal Goal Programming with Priorities Minimize Z = P1 d1- + P2 d2- Subject to: 2X1 + 3X2 &lt;= 640 X1 + d1-- d1 + = 200 X2 + d2-- d2 + = 120 X1, X2 =&gt; d1 + , d1- , d2 + , d2- =&gt; Now the objective function includes priorities GP with Priorities We are a textile company and have the following constraints: ALL OF WHICH ARE GOAL CONSTRAINTS X1 + X2 + d1- - d1+ = 80 hrs. Prod. Capacity X1 + d2- - d2+ = 70 hrs. Upholstery X2 + d3- - d3+ = 45 hrs. Dress material X1 + X2 + d4- - d4+ = 90 hrs. Overtime GP with Priorities Objective Function: Min. Z = P1 d1- + P2 d4+ + P3 d2- + P3 d3- + P4 d1+ (with priorities but no weights) Min. Z = P1 d1- + P2 d4+ + 5P3 d2- + 3P3 d3- + P4 d1+ (with priorities AND weights) GP with Priorities...
View Full Document

## Chapter 15 Part 2 - Chapter 15 Goal Programming Part 2 Goal...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online