Page 1 of 12

Name :
Course and Year :
Subject : Management Science
Class Schedule :
Instructor :

Module 4: The Simplex Maximization Method of Linear Programming

Intended Learning Outcomes

 Define simplex method of linear programming
 Enumerate the steps in solving a maximization problem
 Discuss how to convert constraints to equations
 Solve maximization problems through simplex method:
 Solve maximization problems containing the “greater than” symbol
 Solve maximization problems containing the “equal” symbol in the constraints

Activity
As we start with this lesson, please answer the question below:
Why is it important to maximize profits?

Analysis
In classical economic theory, firms are expected to seek for profit maximization.
Maximizing profits will lead into the following:
- The entity is being able to pay higher salaries and wages to its workers
- It can generate cash flows which can be spent in research and development. Intensive
research and development can greatly benefit the consumers. Through it, the entity
can provide products which are responsive to the needs and demands of its
customers/clients.
- It will help in building up savings, which can eventually help the firm survive any forms
of economic downturn, just like what is happening during the pandemic.
- For firms who are listed in the stock market, publishing big profits will lead to higher
market value of shares.
There are many other positive things that are brought by maximizing profits, thus,
it is very important for managers to know how to utilize effective tools to achieve it.
Linear programming is one of these tools. Linear programming has been discussed in the
previous module, however module three concentrated in graphical method. This time,
module 4 will look into the Simplex method.

Abstraction

1. Simplex Method
a. The simplex method of linear programming was developed by George B. Dantzig
of Stanford University.
b. It is a repetitive optimizing technique.
c. It repeats the process of mathematically removing from an extreme point to
another extreme point (in the graphical method) until an optimal solution is
reached.
d. Unlike the graphical method, simplex can handle an infinite number of variables.

2. SIMPLE MAXIMATION PROBLEMS

a. The method of solving maximization problem is different from minimization in
the simplex method.
b. Steps in Solving a Maximization Problem:
Step 1: Set up the constraints from the conditions of the problem.
Step 2: Convert the inequality explicit constraints to equations by adding
slack variables.
Step 3: Enter the numerical coefficients and variables in the simplex table.
Step 4: Calculate Cj and Zj values.
 Page 2 of 12

Step 5: Determine the optimum column or entering variable by choosing the

most positive value in the Cj – Zj row.
Step 6: Divide the quantity-column values by the non-zero and non-
negative entries in the optimum column. The smallest quotient
belongs to the pivotal row.
Step 7: Compute the values for the replacing row by dividing all entries by
the pivot. Enter the result in the next table.
Step 8: Compute the new entries for the remaining rows by reducing the
optimum column entries to zero (entries in the constraint row)
Step 9: Calculate Cj and Zj values. Compute for Cj – Zj row.
Step 10: If there is a positive entry in the C j – Zj row, return to step 5. The
final solution has been obtained if there no positive value in the C j –
Zj row

EXAMPLE 1: (MAXIMIZATION of profit PROBLEM WITH LESS THAN SIGN)

Consider the following linear programming problem:
The Margan Furniture Problem

Step 1: Set up the constraints from the conditions of the problem.

Maximize: Z=80 x+ 60 y (considered given)

Subject to: 4 x+ 2 y ≤ 60
2 x+ 4 y ≤ 48 Explicit constraints
x≥0; y ≥0 Implicit constraints

(We may use Z to represent the quantity we want to maximize)

Before we convert the explicit constraints to equations, we may have the

option of removing first the greatest common factor in each inequality
whenever possible, to simplify the coefficients. So, dividing each inequality
by 2, (the common factor) we have the program:

Maximize: z=80 x +60 y

Subject to: 4 x+ 2 y ≤ 60 (greatest factor is 2; divide all elements by 2)
2 x+ y ≤ 30
2 x+ 4 y ≤ 48 (Greatest factor is 2; divide all elements by 2)
x +2 y ≤ 24
x≥0; y ≥0

Step 2: Convert the inequality explicit constraints to equations by adding slack

variables.

To convert the inequalities to equations, since our problem, the left

members are less than the right members; they can be equal if we add
some quantities to the left. Let these quantities be called slack variables.
The slack variables fill the gap between the left and the right members of
the inequalities. It can also be said that a slack variable represents the
unused quantities in the constraints. This can be seen in checking the
objectives after the solutions are found.

Let Sn represent the slack variables.

The new program with slack variables will be:

Maximize: Z=80 x+ 60 y+ 0 S 1+ 0 S 2
Subject to: 2 x+ y+ S 1=30
x +2 y+ S 2=24
x≥0; y ≥0
S1 ≥0 ; S2 ≥ 0

Step 3: Enter the numerical coefficients and variables in the simplex table.

Setting up the initial table:

Contribution to profit column
 Page 3 of 12

Variable column

Constant column
Objective coefficients row
Cj 80 60 0 0
Prod Qty
x y S1 S2 Variable row
0 S1 30 2 1 1 0
0 S2 24 1 2 0 1 Constraints coefficients
Zj 0 0 0 0 0
Cj-Zj 80 60 0 0

Initial table contains:

- The coefficients of the objective in Cj row
o Note; slack variables do not contribute any profit; hence they have
zero coefficients in the objective.
- The second row is composed of the product, quantity (or constant column) and
solution variables

The initial table should begin with zero contributions to profit, entered in the C j
column. Since the corresponding variables (with zero profit contribution) are S 1
and S2, then these variables should be the ones entered in the product column.

We must add two or more rows in the table, the Zj and Cj – Zj row is obtained
by multiplying the profit contribution in Cj column by each of the coefficients in
the constraints, and then add their products. Hence:
0 (30 2 1 1 0) = 00000
0 (24 1 2 0 1) = 00000
Zj = 00000

To compute for Cj – Zj row, subtract the entries in Zj row from Cj row entries.
Cj 80 60 0 0
Zj - (0 0 0 0)
Ci - Zj 80 60 0 0

The column containing the greatest positive entry in the Ci - Zj is t

optimum column. In our table, 80 is the greatest positive, hence we encircle
the column.

If we divide 30 and 24 by 2 and 1 respectively, 30÷2 has a smaller quotient,

hence the first constraint row is pivotal row.
Entering Variable / OPTIMUM COLUMN

INITIAL TABLE:
80 60 0 0
Cj Prod Qty
x y S1 S2
0 S1 30 2 1 1 0 Pivotal Row /Outgoing
0 S2 24 1 2 0 1
Zj 0 0 0 0 0
Cj-Zj 80 60 0 0

Outgoing Variable Pivot

Computing for the pivotal row: (Qty ÷ corresponding figure under the optimum
column/entering variable)
S1 row: 30 ÷ 2 = 15
S2 row: 24 ÷ 1 = 24
Least quotient: exclude in the computation those rows with zero or negative
values
Entering The top of the most positive column (for maximization problems) in
Variable the Cj-Zj.

This will replace the Cj in the outgoing variable in the next table
Pivotal Row Smaller quotient when qty is divided by entering variable.
Note: in looking for pivotal row, the divisor must be non-zero and
 Page 4 of 12

non-negative

The pivotal row contains the pivot. It is the number which is boxed
in twice
The pivot is the number which will divide all entries in the pivotal
row (the goal is to put the pivot at 1 in the next table)

The item adjacent to the pivot should be zeroed out in the next table
Outgoing Prod of the pivotal row
variable

The variable found at the top of the optimum column should be the entering variable
or incoming variable and the variable to the left of the pivotal row is the outgoing
variable. The entry encircled twice is called the pivot

SECOND TABLE
The entries in the NEXT TABLE –
Pivot should be equal to 1 by dividing all elements by the pivot
The figures below or above the pivot should be 0 by multiplying all
elements with additive inverse (eg. For positive 1, multiply with negative 1;
for negative 1, multiply positive 1)

Incoming entries (pivotal row) divided by the pivot:

(30 2 1 1 0) ÷ 2 = 15 1 ½ ½ 0 replacing row and should be entered first in

the second table

Computing for S2:

The second constraint row or S 2 row is the row to be replaced. Look for the inverse
additive of the number on the row adjacent to the pivot. Since the numeral found
below pivot is 1 (in the old row) we must multiply the replacing row by -1 (additive
inverse of 1) and add the result to the row to be replaced in order that the entry below
the pivot becomes zero:
15 (-1)+24 = 9
1 (-1) + 1 =0
½ (-1) + 2 = 1 ½ or 3/2
½(-1) + 0 = - ½
0 (-1) + 1 = 1

80 60 0 0
Cj Prod Qty
x y S1 S2
80 x 15 1 ½ ½ 0 Replacing Row
0 S2 9 0 3/2 -½ 1
Zj 1,200 80 40 40 0
Cj-Zj 0 20 -40 0

Compute for Zj row:

80 (15 1 ½ ½ 0) =1, 200 80 40 40 0
0 (9 0 3/2 -1/2 1) = 0 0 0 0 0
1, 200 80 40 40 0

Compute for Cj-Zj

Cj 80 60 0 0
Zj (80) (40) (40) (40)
0 20 -40 0

Get the most positive column as the entering variable

(in this table, column with positive 20 at the bottom, with 60 at the top most)

Get the pivotal row, by dividing the Qty with amounts under the entering variable
(get the smallest quotient)
X row : 15 ÷ ½ = 30
 Page 5 of 12

S2 row: 9 ÷ 3/2 = 6 (this is the S2 row, thus, it will be the pivotal row)
The pivot is 3/2 since it was boxed in twice.

THIRD TABLE:
Incoming Entries: (Pivotal Row divided by the Pivot)
12
(9 0 3/2 – ½ 1) ÷ 3/2 = (6 0 1− )
33

Solving for x row:

Number adjacent to the pivot (above) = ½ (multiply -1/2 to incoming entries)
6( −12 )+ 15=12
0(
2 )
−1
+1=1

1(
2 ) 2
−1 1
+ =0

3 ( 2 ) 2 6 3
−1 −1 1 4 2
+ = ∨

3( 2 )
2 −1 −1
+ 0=
3

80 60 0 0
Cj Prod Qty
x y S1 S2
80 x 12 1 0 2/3 -1/3
60 y 6 0 1 -1/3 2/3
Zj 1320 80 60 100 40
30 30
Cj-Zj 0 0 −100 −40
30 30

Compute for Zj row:

160 80
80 (12 1 0 2/3 -1/3) = 960 80 0 −
30 30
60 120
60 (6 0 1 -1/3 2/3) = 360 0 60−
30 30

100 40
1320 80 60
30 30
Compute for Cj – Zj row:
Cj 80 60 0 0
100 40
Zj 80 60
30 30
 Page 6 of 12

100 40
Cj – Zj 0 0− −
30 30

Since the last row has no more positive entry, then the third table is optimum.
Decision:
x = 12 y=6 Maximum Z = 1320

SUMMARY OF TABLES (EXAMPLE 1)

Maximize: Z=80 x+ 60 y+ 0 S 1+ 0 S 2
Subject to: 2 x+ y+ S 1=30
x +2 y+ S 2=24
x≥0; y ≥0
S1 ≥0 ; S2 ≥ 0

TABLE 1
80 60 0 0
Cj Prod Qty
x y S1 S2
0 S1 30 2 1 1 0
0 S2 24 1 2 0 1
Zj 0 0 0 0 0
Cj-Zj 80 60 0 0

TABLE 2
80 60 0 0
Cj Prod Qty
x y S1 S2
80 x 15 1 ½ ½ 0
0 S2 9 0 3/2 -½ 1
Zj 1,200 80 40 40 0
Cj-Zj 0 20 -40 0

TABLE 3
80 60 0 0
Cj Prod Qty
x y S1 S2
80 x 12 1 0 2/3 -1/3
60 y 6 0 1 -1/3 2/3
Zj 1,320 80 60 100 40
30 30
Cj-Zj 0 0 −100 −40
30 30

EXAMPLE 2: SIMPLEX METHOD OF MAXIMIZATION PROBLEMS CONTAINING

THE “GREATER THAN SYMBOL”

- In maximization problem, we always add a slack variable to convert a constraint to

equation. But if the constraint has ≥ symbol, we cannot transform it to equation by
immediately adding a slack variable for obvious reason.
- We must convert first the ≥ symbol to a ≤ symbol. This is easily done by
multiplying the inequality constraint by negative 1, then add the slack
variable.
-1(6>5)-1
-6 <-5
PROBLEM 2:
Maximize: 50x1 + 20x2
Subject to: x1 ≤ 20
x2 ≤30
x1 + x2 ≥ 48
 Page 7 of 12

x1 ≥ 0; x2 ≥ 0
Solution:
Convert the third constraint to ≤ function by multiplying both sides with negative 1
−1 ( x 1+ x 2 ≥ 48 )−1
−x 1−x 2 ≤−48

Hence the new program after adding slack variables:

Maximize: 50x1 + 20x2 + 0S1 + 0S2 + 0S3
Subject to: x1+ S1 = 20
x2 + S2 = 30
−x 1−x 2+ S ❑3=−48
x1 ≥ 0; x2 ≥ 0, S1 ≥ 0; S2 ≥ 0 S3 ≥ 0
INITIAL TABLE:

50 20 0 0 0
Cj Prod Qty
x1 x2 S1 S2 S3
0 S1 20 1 0 1 0 0
0 S2 30 0 1 0 1 0
0 S3 -48 -1 -1 0 0 1
Zj 0 0 0 0 0 0
Cj - Zj 50 20 0 0 0

Compute for Cj
0 (20 1 0 1 0 0) = 0 0 0 0 0 0
0 (30 0 1 0 1 0) = 0 0 0 0 0 0
0 (-48 -1 -1 0 0 1) = 0 0 0 0 0 0
Zj 0 0 0 0 0 0

Most positive is 50 (column x1) will be the entering variable

Locate the Pivotal Row:
20 ÷ 1 = 20
Row S1 is automatically the pivotal row. Remember that in locating the
pivotal row, the denominator or divisor should NOT be zero nor negative.

TABLE 2
Incoming Variables (Computing the entries in the pivotal row):
- Since the pivot is already 1, no need to divide the pivotal row with the pivot
- Entries therefore: (20 1 0 1 0 0)
- New entries: (20 1 0 1 0 0) / 1(pivot)

Computing entries in the S2 row:

- No need to multiply the additive inverse, since the figure below the pivot is already
zero
- Entries therefore in the S3 row: (30 0 1 0 1 0)
20 (0) + 30 = 30
1 (0) +0 =0
0 (0) +1 = 1
1 (0) +0 =0
0 (0) +1 = 1
0 (0) +0= 0

Computing entries in the S3 row:

- The number below the pivot in this row is -1, thus, to make it zero, the values in the
pivotal row shall be multiplied by positive 1 and then the previous values / entries in
this row (S3 row) shall be added.
- Therefore, the new entries are (-28 0 -1 1 0 1), computed as follows:
20 (1) + -48 = -28
1 (1) + -1 = 0
0 (1) + -1 = -1
1 (1) + 0 = 1
0 (1) + 0 = 0
0 (1) + 1 = 1
 Page 8 of 12

50 20 0 0 0
Cj Prod Qty
x1 x2 S1 S2 S3
50 x1 20 1 0 1 0 0
0 S2 30 0 1 0 1 0
0 S3 -28 0 -1 1 0 1
Zj 1000 50 0 50 0 0
Cj - Zj 0 20 -50 0 0

Computing Zj (Cj times Entries in the pivotal row)

50 (20 1 0 1 0 0) = (1000 50 0 50 0 0)
0 (30 0 1 0 1 0) = (0 0 0 0 0 0)
0 (-28 0 -1 1 0 1) = (0 0 0 0 0 0)
Zj 1000 50 0 50 0 0

Computing Cj - Zj
Cj 50 20 0 0 0
Zj (50 0 50 0 0)
0 20 -50 0 0

Locate the entering variable (the most positive, since it is maximization problem)
- Hence, in this case, the x2 column (most positive figure in the bottom – positive 20)

Locate the pivotal row (the least quotient, when qty is divided by the figures below the
entering variable; provided that the divisor is not negative nor zero)
- Hence, the computation is as follows
x1 - not part of the computation since the value of the divisor aligned in the
column selected above, is zero
S2 = 30 ÷1 = 30
S3 – not part of the computation since the value of the divisor aligned in the
column selected above, is negative
- Therefore , the pivotal row is S2 row and the pivot is 1

TABLE 3
Computing for S2 row (soon to be x2 row in table 3) (entering variable – pivotal
row of the previous table)
- Remember the goal is to set the value at 1, since the value of the pivot is already 1, there
is no need to divide all the entries in this row by the pivot.
- Hence, entries for this row remains to be (30 0 1 0 1 0)

Computing for x1 row:

- Since the value of the figure in the entering variable column aligned to this row is already
zero, there is no need to change the values/entries in this row.
- Hence, entries for this row remains to be (20 1 0 1 0 0)

Computing for S3 row

- Since the value of the entry in this row which falls under the entering variable column is -1,
and the goal is to put it at zero, thus, all entering entries shall be multiplied by positive 1
and the previous entries in this row will then be added.
- Hence, the entries are (2 0 0 1 1 1) computed as follows:
30 (1) + -28 = 2
0 (1) + 0 = 0
1 (1) + -1 = 0
0 (1) + 1 = 1
1 (1) + 0 = 1
0 (1) + 1 = 1

Cj 50 20 0 0 0
Prod Qty
x1 x2 S1 S2 S3
50 x1 20 1 0 1 0 0
20 X2 30 0 1 0 1 0
0 S3 2 0 0 1 1 1
Zj 1600 50 20 50 20 0
Cj - Zj 0 0 -50 -20 0
 Page 9 of 12

Computing the Zj row

- 50 (20 1 0 1 0 0) = 1000 50 0 50 0 0
- 20 (30 0 1 0 1 0) = 600 0 20 0 20 0
- 0 (2 0 0 1 1 1) = 0 0 0 0 0 0
Zj 1600 50 20 50 20 0

The table is the optimal table since all the entries in the C j-Zj are already
either negative or zero.

Therefore, the decision:

X1 = 20
X2 = 30
Maximum: P1, 600

EXAMPLE 3: MAXIMIZATION PROBLEMS CONTAINING THE “EQUAL”SYMBOL IN THE

CONSTRAINTS:
- Rule: Add slack variable to the left member of the constraint containing the equal symbol.
- In an equality constant, the slack variable will have a value equal to the constant if the
solution variables are zero.

PROBLEM 3:
Maximize: 5X1 + 4X2
Subject to: 2X1 + X2 = 12
2X1 + 3X2 ≤ 24
2X1 + 9X2 ≥ 36
X1 ≥ 0; X2 ≥ 0

Conversion of inequality with “greater” than sign

-1(2X1 + 9X2 ≥ 36)-1 = -2X1 - 9X2 ≤ -36

New program with Slack variables:

Maximize: 5X1 + 4X2 + 0S1 + 0S2 + 0S3
Subject to: 2X1 + X2 + S1 = 12
2X1 + 3X2 + S2 = 24
-2X1 - 9X2 + S3 = -36
X1 ≥ 0; X2 ≥ 0; S1 ≥ 0; S2 ≥ 0 S3 ≥ 0
INITIAL TABLE

5 4 0 0 0
Cj Prod Qty
x1 x2 S1 S2 S3
0 S1 12 2 1 1 0 0
0 S2 24 2 3 0 1 0
0 S3 -36 -2 -9 0 0 1
Zj 0 0 0 0 0 0
Cj - Zj 5 4 0 0 0

Compute for Zj row:

0 (12 2 1 1 0 0) = 0 0 0 0 0 0
0 (24 2 3 0 1 0) = 0 0 0 0 0 0
0 (36 2 9 0 0 1) = 0 0 0 0 0 0
Zj 0 0 0 0 0 0

Locate the entering variable (the most positive, since it is maximization problem)
- Hence, in this case, the X1 column (most positive figure in the bottom – positive 5)

Locate the pivotal row (the least quotient, when qty is divided by the figures below
the entering variable; provided that the divisor is not negative nor zero)
- Hence, the computation is as follows
S1 row = 12 ÷ 2 = 6
S2 row = 24 ÷ 2 =12
S3 row = not part of the computation since divisor is negative (-2)
- Therefore , the pivotal row is S1 row, since it has the least quotient and the pivot is 2
 Page 10 of 12

TABLE 2:
Computing entries for S1 row, the pivotal row (soon to be X1 - the entering variable)
- Since the pivot is 2, and the goal is to make the pivot equal to 1 in the next table, thus,
all entries in this row shall be divided by 2(the pivot). The entries therefore are
(1 2 1 1 0 0) ÷2 = (6 1 1 1 0 0)
2 2 2

Computing the entries for S2 row

- Since the value of the entry in this row which falls under the entering variable column is
positive 2, and the goal is to put it at zero, thus, all entering entries shall be multiplied by
negative 2 and the previous entries in this row will then be added.
- Hence, values are computed as follows:
6 (-2) + 24 =12
1(-2) + 2 = 0
1
(-2) + 3 = 2
2
1
(-2) + 0 =-1
2
0(-2) + 1 =1
0(-2) + 0 =0

Computing the entries for S3 row

- Since the value of the entry in this row which falls under the entering variable column is
negative 2, and the goal is to put it at zero, thus, all entering entries shall be multiplied by
positive 2 and the previous entries in this row will then be added.
Hence, values are computed as follows:
6 (2) + -36 =-24
1(2) + -2 = 0
1
(2) + -9 =-8
2
1
(2) + 0 =1
2
0(2) + 0 =0
0(2) + 1 =1

5 4 0 0 0
Cj Prod Qty
x1 x2 S1 S2 S3
5 X1 6 1 1 1 0 0
2 2
0 S2 12 0 2 -1 1 0
0 S3 -24 0 -8 1 0 1
Zj 30 5 5 5 0 0
2 2
Cj - Zj 0 3 −5 0 0
2 2

Computing for Zj row:

5 (6 1 1 1 0 0) = 30 5 5 5 0 0
2 2 2 2
0 (12 0 2 -1 1 0) = 0 0 0 0 0 0
0 (-24 0 -8 1 0 1) = 0 0 0 0 0 0
30 5 5 5 0 0
2 2 Locate the entering variable
(the most positive, since it is
maximization problem)
3
- Hence, in this case, the X2 column (most positive figure in the bottom – positive )
2

Locate the pivotal row (the least quotient, when qty is divided by the figures below
the entering variable; provided that the divisor is not negative nor zero)
- Hence, the computation is as follows
1
X1 row = 6 ÷ = 12
2
 Page 11 of 12

S2 row = 12 ÷ 2 =6
S3 row = not part of the computation since divisor is negative (-8)

- Therefore , the pivotal row is S2 row, since it has the least quotient and the pivot is 2

TABLE 3
Computing the entries for S2 row (soon to be X2 – pivotal row)
- Since the pivot is still 2, and the goal is to make the pivot equal to one in the next
table, all old entries in the pivotal row shall be divided by 2.
- Hence, the entries should be:
(12 0 2 -1 1 0) ÷2 = (6 0 1 −1 1 0)
2 2

Computing entries for X1 row,

- Since the value of the entry in this row which falls under the entering variable column is
positive ½ , and the goal is to put it at zero, thus, all entering entries (pivotal row entries)
shall be multiplied by negative ½ and the previous entries in this row will then be added.
6 (-1/2) +6 = 3
0 (-1/2) + 1 = 1
1 (-1/2) +1/2 = 0
−1
(-1/2) + ½ = ¾
2
1
(-1/2) + 0 = -1/4
2
0 (-1/2) + 0 = 0

Computing the entries for S3 row

- Since the value of the entry in this row which falls under the entering variable column is
negative 8, and the goal is to put it at zero, thus, all entering entries shall be multiplied by
positive 8 and the previous entries in this row will then be added.
Hence, values are computed as follows:
6 (8) + -24 =24
0(8) + 0 = 0
1(8) + -8 =0
−1
(8) + 1 =-3
2
1
(8) + 0 =4
2
0(8) + 1 =1

Cj 5 4 0 0 0
Prod Qty
x1 x2 S1 S2 S3
5 X1 3 1 0 3 −1 0
4 4
4 X2 6 0 1 −1 1 0
2 2
0 S3 24 0 0 -3 4 1
Zj 39 5 4 7 3 0
4 4
Cj - Zj 0 0 −7 −3 0
4 4

Computing for Zj row:

5 (3 1 0 3 −1 0 = 1 5 0 15 −1 0
4 4 5 4 4
4 (6 0 1 −1 1 0) = 2 0 4 -2 2 0
2 2 4
0 (24 0 0 -3 4 1) = 0 0 0 0 0 0
Zj 3 5 4 7 3 0
9 Since all columns
4 4
have either o or
negative Cj - Zj, thus, this is the optimum table.
 Page 12 of 12

Decision:
X1 = 3; X2 = 6
Maximum: P39

Application

Write your answers in any clean piece of paper. Take a picture and submit it via Google
Classroom. Ensure that every sheet of your submission is labeled with your name.
Show your solution and box-in your final answer.

1. Maximize: 50X1 + 40X2

Subject to: 2X1 + X2 = 12
2X1 + 3X2 ≤ 24
2X1 + 9X2 ≥ 36
X1 ≥ 0; X2 ≥ 0

2. A poultry raiser plans to raise chicken, ducks and turkeys. He has room for only
200 birds and wishes to limit the number of turkeys to a maximum of 25, the
number of turkeys and ducks to a maximum of 100. His estimated profits are
P30, P25 and P120 on each chicken, duck and turkey respectively. How many of
each should he raise to maximize his profit?

***NOTHING FOLLOWS**