Table of Contents

1.1 Summary of this model formulation:................................................................................4

1.2 Graphical Model of this problem:.....................................................................................4

1.3 Objective Function:...........................................................................................................5

1.4 Constraints:.......................................................................................................................5

1.5 code on lingo:....................................................................................................................6

1.6 Optimal solution:...............................................................................................................6

List of Table
Table 1: Data of capacity of stage 1, 2, 3 machines........................................................................2
Table 2: Data of cost from stage 1 to stage 2 machines...................................................................3
Table 3: Data of cost from stage 2 to stage 3 machines...................................................................3

1|Page
 The Graphic Palette
The Graphic Palette is a firm in Charleston, South Carolina, that does graphic artwork and
produces color and black-and-white posters, lithographs, and banners. The firm’s owners,
Kathleen and Lindsey Taylor, have been approached by a client to produce a spectacularly
colored poster for an upcoming arts festival. The poster is more complex than anything
Kathleen and Lindsey have previously worked on. It requires color screening in three stages,
and the processing must proceed rapidly to produce the desired color effect. By suspending
all their other jobs, they can devote three machines to the first stage, four to the second stage,
and two to the last stage of the process. Posters that come off the machines at each stage can
be processed on any of the machines at the next stage. However, all the machines are of
different models and of varying ages, so they cannot process the same number of posters in
the specified time frame necessary to complete the job. The different machine capacities at
each stage are as follows:

Table 1: Data of capacity of stage 1, 2, 3 machines

Stage 1 Stage 2 Stage 3

Machine 1 = 750 Machine 4 = 530 Machine 8 = 620

Machine 2 = 900 Machine 5 = 320 Machine 9 = 750

Machine 3 = 670 Machine 6 = 450

Machine 7 = 250

Because the machines are of different ages and types, the costs of producing posters on them
differ. For example, a poster that starts on machine 1 and then proceeds to machine 4 costs
$18. If this poster at machine 4 is then processed on machine 8, it costs an additional $36.
The processing costs for each combination of machines for stages 1, 2, and 3 are as follows:

2|Page
 Table 2: Data of cost from stage 1 to stage 2 machines

Machine (cost) Machine (cost) Machine (cost) Machine (cost)

Machine 4 5 6 7

1 $18 $23 $25 $21

2 20 26 24 19

3 24 24 22 23

Table 3: Data of cost from stage 2 to stage 3 machines

Machine (cost) Machine (cost)

Machine 8 9

4 $36 $41

5 40 52

6 42 46

7 33 49

Kathleen and Lindsey are unsure how to route the posters from one stage to the next to make as
many posters as they possibly can at the lowest cost. Determine how to route the posters through
the various stages for Graphic Palette the minimize costs.

3|Page
1.1 Summary of this model formulation:
Step 1: Define the Decision variable
Find out the best route to make as many as possible number of posters for the upcoming arts
festival
Step 2: Define the Objective Function
To minimize the different stages cost
Step 3: Define the Constraint
The resources available including machines

1.2 Graphical Model of this problem:

1
8
5

6
9

3
7

4|Page
1.3 Objective Function:
Minimize = Z = 18x14 + 23x15 + 25x16 + 21x17 + 20x24 + 26x25 + 24x26 + 19x27 + 24x34 + 24x35 +
22x36 + 23x37 + 36x48 + 41x49 + 40x58 + 52x59 + 42x68 + 46x69 + 33x78 + 49x79

1.4 Constraints:
The capacity constraints for stage 1

x14 + x15 + x16 + x17 <=750

x24 + x25 + x26 + x27 <=900

x34 + x35 + x36 + x37 <=670

The capacity constraint for stage 2

x14 + x24 + x34 <=530

x15 + x25 + x35 <=320

x16 + x26 + x36 <=450

x17 + x27 + x37 <=250

the capacity constraint for stage 3

x48 + x58 + x68 + x78 = 620

x49 + x59 + x69 + x79 = 750

the additional cost constraints for stage 1,2,3

x14 + x24 + x34 - x48 - x49=0

x15 + x25 + x35 - x58 - x59=0

x16 + x26 + x36 - x68 - x69=0

x17 + x27 + x37 - x78 - x79=0

the non-negativity constraints

xij>=0

5|Page
1.5 code on lingo:
min Z = 18x14 + 23x15 + 25x16 + 26x17 + 20x24 + 26x25 + 24x26 + 19x27 + 24x34 + 24x35 + 22x36 +
23x33 + 36x48 + 41x49 + 40x58 + 52x59 + 42x68 + 46x69 + 33x78 + 49x79 (1)

x14 + x15 + x16 + x17 <=750; (2)

x24 + x25 + x26 + x27 <=900; (3)

x34 + x35 + x36 + x37 <=670; (4)

x15 + x25 + x35 <=320; (5)

x14 + x24 + x34 <=530; (6)

x16 + x26 + x36 <=450; (7)

x17 + x27 + x37 <=250; (8)

x48 + x58 + x68 + x78 = 620; (9)

x49 + x59 + x69 + x79 = 750; (10)

x14 + x24 + x34 - x48 - x49=0; (11)

x15 + x25 + x35 - x58 - x59=0; (12)

x16 + x26 + x36 - x68 - x69=0; (13)

x17 + x27 + x37 - x78 - x79=0; (14)

x14>=0; (15)

x15>=0; (16)

x16>=0; (17)

x17>=0; (18)

x24>=0; (19)

x25>=0; (20)

x26>=0; (21)

x27>=0; (22)
6|Page
x34>=0; (23)

x35>=0; (24)

x36>=0; (25)

x37>=0; (26)

x48>=0; (27)

x49>=0; (28)

x58>=0; (29)

x59>=0; (30)

x68>=0; (31)

x69>=0; (32)

x78>=0; (33)

x79>=0; (34)

1.6 Optimal solution:

Global optimal solution found.

Objective value: Z = 82, 540 dollars

Variable Value

x14 530

x48 150

x69 370

x49 380

x15 220

x58 220

x78 250

7|Page
x27 250

x36 370

Equation Slack or Constraints Values of variables

Surplus
1 82540.00 Z = 18x14 + 23x15 + 25x16 + 26x17 + X14 =
20x24 + 26x25 + 24x26 + 19x27 + 24x34
530.0000
+ 24x35 + 22x36 + 23x33 + 36x48 +
41x49 + 40x58 + 52x59 + 42x68 + 46x69
+ 33x78 + 49x79
2 0.000000 x14 + x15 + x16 + x17 <=750; X15 = 220.0000

3 650.0000 x24 + x25 + x26 + x27 <=900; X16 = 0.000000

4 300.0000 x34 + x35 + x36 + x37 <=670; X17 = 0.000000

5 0.000000 x15 + x25 + x35 <=320; X24 = 0.000000

6 100.0000 x14 + x24 + x34 <=530; X25 = 0.000000

7 80.00000 x16 + x26 + x36 <=450; X26 = 0.000000

8 0.000000 x17 + x27 + x37 <=250; X27 = 250.0000

9 0.000000 x48 + x58 + x68 + x78 = 620; X34 = 0.000000

10 0.000000 x49 + x59 + x69 + x79 = 750; X35 = 0.000000

11 0.000000 x14 + x24 + x34 - x48 - x49=0; X36 = 370.0000

12 0.000000 x15 + x25 + x35 - x58 - x59=0; X37 = 0.000000

13 0.000000 x16 + x26 + x36 - x68 - x69=0; X48 = 150.0000

14 0.000000 x17 + x27 + x37 - x78 - x79=0; X49 = 380.0000

15 530.0000 x14>=0; X58 = 220.0000

16 220.0000 x15>=0; X59 = 0.000000

17 0.000000 x16>=0; X68 = 0.000000

8|Page
18 0.000000 x17>=0; X69 = 370.0000

19 0.000000 x24>=0; X78 = 250.0000

20 0.000000 x25>=0; X79 = 0.000000

21 0.000000 x26>=0;

22 250.0000 x27>=0;

23 0.000000 x34>=0;

24 0.000000 x35>=0;

25 370.0000 x36>=0;

26 0.000000 x37>=0;

27 150.0000 x48>=0;

28 380.0000 x49>=0;

29 220.0000 x58>=0;

30 0.000000 x59>=0;

31 0.000000 x68>=0;

32 370.0000 x69>=0;

33 250.0000 x78>=0;

34 0.000000 x79>=0;

9|Page
 4
530
150
1
220 8
5 220
380

6
370
9
370 250 250
3
7

10 | P a g e
11 | P a g e