HOW TO SOLVE & FORMULATE THIS USING LINGO ? WHAT IS THE CODE? (OPERATION RESEARCH)

The complete model thus becomes: Maximize z = 30x1 + 40x2 + 20x3 + 10x4-(15s1 + 20s2 + 10s + 8s) subject to 0.30x10.30x2+ 0.25x3 0.15x4 s 1000 0.25X1 + 0.35X2 + 0.30X3 + 0.10X41000 0.45x1 0.50x2 0.40x3 0.22x4 s 1000 0.15x1 0.15x2 O.10x3 +0.05x4 s 1000 x1 + s1 = 800, x2 + s2 = 750, x3 +S3=600, x4 + S4 = 500 x;20, sj 0, j = 1, 2, 3, 4 Solution: The optimum solution is z = $64,625, x: 800, x2-750; x: 3875, x: 500, s: s2 : s4: 0, 53 212.5. The solution satisfies all the demand for both types of jackets and the gloves. A shortage of 213 (rounded up from 212.5) pairs of pants will result in a penalty cost of 213 x $10 $2130. The complete model thus becomes: Maximize z = 30x1 + 40x2 + 20x3 + 10x4-(15s1 + 20s2 + 10s + 8s) subject to 0.30x10.30x2+ 0.25x3 0.15x4 s 1000 0.25X1 + 0.35X2 + 0.30X3 + 0.10X41000 0.45x1 0.50x2 0.40x3 0.22x4 s 1000 0.15x1 0.15x2 O.10x3 +0.05x4 s 1000 x1 + s1 = 800, x2 + s2 = 750, x3 +S3=600, x4 + S4 = 500 x;20, sj 0, j = 1, 2, 3, 4 Solution: The optimum solution is z = $64,625, x: 800, x2-750; x: 3875, x: 500, s: s2 : s4: 0, 53 212.5. The solution satisfies all the demand for both types of jackets and the gloves. A shortage of 213 (rounded up from 212.5) pairs of pants will result in a penalty cost of 213 x $10 $2130