Assignment 1
Linear Programming
1. Company XYZ manufactures products A, B, C & D which must go through the departments of wiring, drilling, assembly and inspection. The time requirement in each department and the unit profit are given in the table below:
Wiring
Drilling
Assembly
Inspection
Unit Profit
Minimum Production Level
Product
A
0.5
3
2
0.5
$ 9
150
B
1.5
1
4
1.0
$ 12
100
C
1.5
2
1
0.5
$ 15
300
D
1.0
3
2
5.5
$ 11
400
The production time available in each department each month and the minimum monthly production requirement is given below.
Capacity (hours)
Wiring
2500
Drilling
2350
Assembly
2600
Inspection
3200
Formulate (objective function and constraint) as a linear programming problem.
2. A company makes three products, and it has three machines available. The LP problem is formulated as below.
Max Z: 4x1+ 4x2+ 7x3
Subject to:
1x1+ 7x2+ 4x3 ≤ 100 (hours on machine 1)
2x1+ 1x2+ 7x3 ≤ 100 (hours on machine 2)
8x1+ 4x2+ 1x3 ≤ 100 (hours on machine 3)
Determine the optimal solution using Excel Solver.
Assignment 1
Linear Programming
1. Company XYZ manufactures products A, B, C & D which must go through the departments of wiring, drilling, assembly and inspection. The time requirement in each department and the unit profit are given in the table below:
Wiring
Drilling
Assembly
Inspection
Unit Profit
Minimum Production Level
Product
A
0.5
3
2
0.5
$ 9
150
B
1.5
1
4
1.0
$ 12
100
C
1.5
2
1
0.5
$ 15
300
D
1.0
3
2
5.5
$ 11
400
The production time available in each department each month and the minimum monthly production requirement is given below.
Capacity (hours)
Wiring
2500
Drilling
2350
Assembly
2600
Inspection
3200
Formulate (objective function and constraint) as a linear programming problem.
2. A company makes three products, and it has three machines available. The LP problem is formulated as below.
Max Z: 4x1+ 4x2+ 7x3
Subject to:
1x1+ 7x2+ 4x3 ≤ 100 (hours on machine 1)
2x1+ 1x2+ 7x3 ≤ 100 (hours on machine 2)
8x1+ 4x2+ 1x3 ≤ 100 (hours on machine 3)
Determine the optimal solution using Excel Solver.