Solution for Assignment of (Math356)
Q1: Given Data:
Component A: 1 hour fabrication, 2 hours assembly, profit = 7 Birr
Component B: 1 hour fabrication, 2 hours assembly, profit = 9 Birr
Component C: 2 hours fabrication, 2 hours assembly, profit = 10 Birr
Constraints:
o Fabrication time: 1000 hours
o Assembly time: 800 hours
Decision Variables:
Let:
x1x_1 = number of component A produced
x2x_2 = number of component B produced
x3x_3 = number of component C produced
Objective Function:
Maximize profit:
Z=7x1+9x2+10x3Z = 7x_1 + 9x_2 + 10x_3
Constraints:
Fabrication:
x1+x2+2x3≤1000x_1 + x_2 + 2x_3 \leq 1000
Assembly:
2x1+2x2+2x3≤8002x_1 + 2x_2 + 2x_3 \leq 800
Non-negativity:
x1,x2,x3≥0x_1, x_2, x_3 \geq 0
Q2: Minimize: Z=7y1+8y2Z = 7y_1 + 8y_2
Subject to constraints: 3y1+y2≥83y_1 + y_2 \geq 8 y1+3y2≥11y_1 + 3y_2 \geq 11 y1,y2≥0y_1,
y_2 \geq 0
Graphical solution involves plotting constraint lines, determining the feasible region, and finding
the point that minimizes Z.
Q 3: Maximize: Z=4x1+3x2+4x3+6x4Z = 4x_1 + 3x_2 + 4x_3 + 6x_4
Subject to: x1+2x2+2x3+4x4≤80x_1 + 2x_2 + 2x_3 + 4x_4 \leq 80 2x1+2x3+x4≤602x_1 + 2x_3
+ x_4 \leq 60 3x1+3x2+x3+x4≤803x_1 + 3x_2 + x_3 + x_4 \leq 80 x1,x2,x3,x4≥0x_1, x_2, x_3,
x_4 \geq 0
Q4: Given primal problem: Maximize: Z=3x1+2x2Z = 3x_1 + 2x_2
Subject to: x1+x2≥1x_1 + x_2 \geq 1 x1+x2≤7x_1 + x_2 \leq 7 x1+2x2≤10x_1 + 2x_2 \leq 10
x2≤3x_2 \leq 3 x1,x2≥0x_1, x_2 \geq 0
Q5: Steps include:
1. Identifying decision variables
2. Formulating the objective function
3. Writing constraints
4. Converting inequalities to equalities using slack/surplus variables
5. Constructing simplex tableau
Q6: Using minimax and max min principles, we determine:
Saddle points (if any)
Mixed strategies using linear programming or dominance method
Expected value of the game
Q7: For given payoff matrices:
Use dominance method to simplify
Solve using graphical or algebraic method
Determine optimal mixed strategy and game value
