Goal Programming1
Goal Programming1
(0, 40)
Z = 36000
(25, 20)
X1 + X2 ≥ 40
Z = α O1 + β O2
4X1 + 5X2 ≤ 200 All points joining (0, 40) and (25, 20)
are non dominated solutions
Targets and Goals
6X1 + 3X2 ≤ 210
4X1 + 5X2 ≤ 200
6X1 + 3X2 ≤ 210 8X1 + 9X2 ≥390
X1 + X2 ≥ 40 (0, 40)
X1 , X 2 ≥ 0 Z = 36000
(25, 20)
Goal is to have a profit of 39000 X1 + X2 ≥ 40
Goal is to have no overtime (30, 10)
(50, 0)
Goals (as constraints) (35, 0)
800X1 + 900X2 ≥ 39000 4X1 + 5X2 ≤ 200
System constraints
4X1 + 5X2 ≤ 200 Minimize w1e1 + w2d2
6X1 + 3X2 ≤ 210
Minimize 2e1 + d2
X1 + X2 ≥ 40
(25, 20) e1 =1000, d2 = 250 Z
X1 , X 2 ≥ 0
Goal constraints = 2250
800X1 + 900X2 – d1 + e1 = 39000
Minimize e1 + 15d2
50X1 + 70X2 – d2 + e2 = 2400
(27.77, 14.44 e1 =3777.77,
d2 = 0 Z = 3777.78
Ranking the goals – Preemptive (Lexicographic) Goal Programming