John Romme Asia

BSMA 2-10

CASE 3

PROBLEM
Solve the following goal programming model graphically and by using the computer solution:

Objective function:

Minimize P1d1+, P2d2 -, P3d3 -,

Goal/Constraint #1:

P1d1+

This is minimized because it is the goal with the highest priority.

Goal/Constraint #2:

P2d2 –

This is minimized after the first priority is minimized because this is only the second among
priorities.

Goal/Constraint #3:

P3d3 –
After all the sub-goals have been minimized, this sub-goal will then be minimized, because this one
has the least priority.

Goal/Constraint#

4:
xj ≥
di-/+ ≥
The non-negativity constraint.
Next we will do is to encode all of the data is Windows QM
The answer that will be produced will be shown by the data below with various graphs for
illustration