Determine the mix of different types of computers (Type 1, Type 2, and Type 3) that will maximize profit

Hours Type 1 Type 2 Type 3

Fabrication 2 3 2
Assembly 1 1 2

Type 1 (X1)Type 2 (X2) Type 3 (X3) Total Contributions (Profit) Max available capacity for labour-hour
Decision variables 200 0 300
Contributions 7 8 10 4400
Labour hours use:
Fabrication 2 3 2 1000 1000
Assembly 1 1 2 800 800
able capacity for labour-hours
Determine the mix of tables and chairs that will maximize profit

Machines Table Chair

M1 7 4
M2 5 5

Tables (T) Chairs (C)

Decision variables 0 50
Contributions 40 30
Machine use:
Machine 1 7 4
Machine 2 5 5

Steps:
1. Identify the decision variables: In this case tables and chairs
2. Identify the contributions of each products to the total profit
3. Calculate the total contribution (profit)
4. Identify the machine use and calculate the use for each products
5. Go to the 'Data' menue and click on it.
6. Click on Solver, and do the following under the Solver box
7. Select the cell that contains the total profit and Insert it in the target Cell
8. In the changing cell, select and insert the cells that contain the decision variable
9. In the Constraints cell, add the two constraints: In the cell reference select the cell that contains M1 and M2 with the m
10. Click the 'Option' button, and select the following assumptions: Linear model and Non-negative, and click 'Ok'
11. Click 'Solve' button
 Total Contributions (Profit) Max available capacity for machines

1500

200 200
250 400

t the cell that contains M1 and M2 with the max available capacity cells to be inserted in their respective cells with less than and equa
odel and Non-negative, and click 'Ok'
with less than and equal signs chosen
 X1
Decision variables 0

Constributions 1

Constraints
Production constraint 1
Demand constraint 1
Contract agreement 0
 Maximize P= X1 - X2 + 3X3
Subject to: (A) X1 + X2 <=20
(B) X1 + X3 = 5
(C) X2 + X3 >=10
X1, X2 , X3 >=0
X2 X3 Total Contrib Maximum Available
5 5

-1 3 10

1 0 5 20
0 1 5 5
1 1 10 10
- X2 + 3X3
1 + X2 <=20

1 + X3 = 5

X2 + X3 >=10
X2 , X3 >=0
 X Y
Decision variables 6.666667 2.666667
Contributions 7 9

Constraints:
A) 3 6
B) 8 4
Minimize Z= 7X + 9Y
Subject to: A) 3X + 6Y ≥ 3
B) 8X + 4Y ≥ 6
X, Y ≥ 0
Minimum contribution Max. Available

70.6666666666667

36 36
64 64
3X + 6Y ≥ 36
8X + 4Y ≥ 64
X, Y ≥ 0