Please help with question using Octave glpk package. Thank you!

The Suitcase Manufacturing Company produces a number of different types of suitcases of varying

qualities, which are called S1, S2, S3, S4 and S5. The manufacturing process involves different

departments in the factory, and we call these departments D1 to D6. Each suitcase requires time

(in minutes) in the various departments as follows

D1 D2 D3 D4 D5 D6

S1 10 15 10 12 5 5

S2 15 20 16 20 5 5

S3 21 25 20 20 8 8

S4 26 21 28 25 10 10

S5 33 28 30 29 15 15

The contribution of gross profit (i.e., the selling price less the cost of raw materialls) of each type

of suitcase is given in the following table, which also shows the minimum number of each type

of suitcase that must be produced together with the maximum number (in terms of contracts with

retail stores)

S1 S2 S3 S4 S5

Profit (Rands) 120 150 235 300 350

Minimum number 200 100 100 100 100

Maximum number 500 300 300 300 300

In addition, there is, this month, a supply limitation on the locks used on the higher quality suitcases

(S3, S4 and S5), and the total production of these suitcases cannot exceed 600.

Each department can provide 24000 minutes per month, except Department D6, which can only

offer 15000 minutes. How much of each product line should be produced so as to maximize the

companys trading profit?

This is what I did so far, but am stuck.

% Objective function is: L = 120x1 + 150x2 + 235x3 + 300x4 + 350x5 C = [120; 150; 235; 300; 350];

%Constraints are: % x3 + x4 + x5 <= 600 % 10x1 + 15x2 + 21x3 + 26x4 + 33x5 <= 2400 % 15x1 + 20x2 + 25x3 + 21x4 + 28x5 <= 2400 % 10x1 + 16x2 + 20x3 + 28x4 + 30x5 <= 2400 % 12x1 + 20x2 + 20x3 + 25x4 + 29x5 <= 2400 % 5x1 + 5x2 + 8x3 + 10x4 + 15x5 <= 2400 % 5x1 + 5x2 + 8x3 + 10x4 + 15x5 <= 15000

A = [0 0 1 1 1; 10 15 21 26 33; 15 20 25 21 28; 10 16 20 28 30; 12 20 20 25 29;... 5 5 8 10 15; 5 5 8 10 15]; %left side of inequality constraint b = [600; 2400; 2400; 2400; 2400; 2400; 15000]; %right side of inequality % constraints

lb = [200; 100; 100; 100; 100]; % minimum number ub = [500; 300; 300; 300; 300]; % maximum number ctype = "UUUUUUU"; %seven U's for seven constraints. All are less than or %equal to (<= bi) vartype = "CCCCC"; %String of characters with length equal to x s = -1; %-1 for maximum +ve for minimum

[xmax, Lmax] = glpk(C,A,b,lb,ub,ctype,vartype,s)