Convert the following linear programming problem into dual
problem.
Maximise
Z = 22x1 + 25x2 +19x3
Subject to:
18x1 + 26x2 + 22x3 ≤ 350
14x1 + 18x2 + 20x3 ≥180
17x1 + 19x2 + 18x3 = 205
x1, x2, x3 ≥ 0
Maximise 1170x1 + 1110x2
Subject to: 9x1 + 5x2 ≥ 500
7x1 + 9x2 ≥ 300
5x1 + 3x2 ≤ 1500
7x1 + 9x2 ≤ 1900
2x1 + 4x2 ≤ 1000
x1, x2 ≥ 0
-Find graphically the feasible region and the optimal solution
I need operational research answers
Solve the game
solve the game
. A bed mart company is in the business of manufacturing beds and pillows. The company has 40 hours for assembly and 32 hours for finishing work per day. Manufacturing of a bed requires 4 hours for assembly and 2 hours for finishing. Similarly a pillow requires 2 hours for assembly and 4 hours for finishing. Profitability analysis indicates that every bed would contribute Birr 80, while a pillow contribution is Birr 55 respectively. Find out the daily production of the company to maximise the contribution (profit). Solve the problem by graphical method.
A bed mart company is in the business of manufacturing beds and
pillows. The company has 40 hours for assembly and 32 hours for
finishing work per day. Manufacturing of a bed requires 4 hours for
assembly and 2 hours for finishing. Similarly a pillow requires 2 hours
for assembly and 4 hours for finishing. Profitability analysis indicates
that every bed would contribute Birr 80, while a pillow contribution is
Birr 55 respectively. Find out the daily production of the company to
maximise the contribution (profit). Solve the problem by graphical
method.
A bed mart company is in the business of manufacturing beds and
pillows. The company has 40 hours for assembly and 32 hours for
finishing work per day. Manufacturing of a bed requires 4 hours for
assembly and 2 hours for finishing. Similarly a pillow requires 2 hours
for assembly and 4 hours for finishing. Profitability analysis indicates
that every bed would contribute Birr 80, while a pillow contribution is
Birr 55 respectively. Find out the daily production of the company to
maximise the contribution (profit). Solve the problem by graphical
method.
Solve the following LPP using two phase method
Max Z= 2x1+3x2+10x3
subject to x1+2x3=0
x2+x3=1
x1,x2,x3≥0
The Star hotel was burned down in a fire and the manager decided to accommodate the
guests in 4–person and 8-person tents. The tents were to be hired at a cost of Kshs 1,500 and
Kshs 4,500 per night respectively, the space available could accommodate at most 13 tents
and the manager had to cope with at least 64 guests.
Required
Formulate this as a linear programming model that could be used to determine the number
of tents of each type that could pull up in order to minimize the overall cost. (10 Marks