Given $x+2 y>1$ $\begin{array}{l} \Rightarrow 2 y>1-x \\ \Rightarrow y>\frac{1}{2}-\frac{x}{2} \end{array}$ Consider the equation $y=\frac{1}{2}-\frac{x}{2}$ Finding points on the...
A manufacturer produces two Models of bikes – Model X and Model Y. Model X takes
man-hours to make per unit, while Model Y takes
man-hours per unit. There is a total of
man-hour available per week. Handling and Marketing costs are Rs
and Rs
per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs
and Rs
, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.
Let’s take x an y to be the number of models of bike produced by the manufacturer. From the question we have, Model x takes \[6\] man-hours to make per unit Model y takes \[10\] man-hours to make...
Maximize Z = x + y subject to
.
Given: Z = x + y subject to constraints, \[x~+\text{ }\mathbf{4}y~\text{£}\text{ }\mathbf{8},\text{ }\mathbf{2}x~+\text{ }\mathbf{3}y~\text{£}\text{ }\mathbf{12},\text{...
Refer to Exercise 15. Determine the maximum distance that the man can travel.
As per the solution of exercise 15, we have Maximize Z = x + y, subject to the constraints \[2x\text{ }+\text{ }3y\le 120\] … (i) \[8x\text{ }+\text{ }5y\le 400\]… (ii) \[x\ge 0,\text{ }y\ge 0\]...
Refer to Exercise 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit?
As per the solution of exercise 14, we have Maximize \[Z\text{ }=\text{ }200x\text{ }+\text{ }120y\]subject to constrains \[3x\text{ }+\text{ }y\le 600\]…. (i) \[x\text{ }+\text{ }y\le 300\]…. (ii)...
Refer to Exercise 13. Solve the linear programming problem and determine the maximum profit to the manufacturer.
From the solution of exercise 13, we have The objective function for maximum profit \[Z\text{ }=\text{ }100x\text{ }+\text{ }170y\] Subject to constraints, \[x\text{ }+\text{ }4y\le 1800\]…. (i)...
Refer to Exercise 12. What will be the minimum cost?
As per the solution of exercise 12, we have The objective function for minimum cost is \[Z\text{ }=\text{ }400x\text{ }+\text{ }200y\] Subject to the constrains; \[5x\text{ }+\text{ }2y\ge 30\]….....
Refer to Exercise
. How many of circuits of Type A and of Type B, should be produced by the manufacturer so as to maximize his profit? Determine the maximum profit.
As per the solution of exercise \[11\], we have Maximize \[Z\text{ }=\text{ }50x\text{ }+\text{ }60y\]subject to the constraints \[20x\text{ }+\text{ }10y\le 200\text{ }2x\text{ }+\text{ }y\le 20\]…...
A man rides his motorcycle at the speed of
km/hour. He has to spend Rs
per km on petrol. If he rides it at a faster speed of
km/hour, the petrol cost increases to Rs
per km. He has at most Rs
to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.
Let’s assume the man covers x km on his motorcycle at the speed of \[50\]km/hr and covers y km at the speed of \[50\] km/hr and covers y km at the speed of \[80\] km/hr. So, cost of petrol =...
A company manufactures two types of sweaters: type A and type B. It costs Rs
to make a type A sweater and Rs
to make a type B sweater. The company can make at most
sweaters and spend at most Rs
a day. The number of sweaters of type B cannot exceed the number of sweaters of type A by more than 100. The company makes a profit of Rs
for each sweater of type A and Rs
for every sweater of type B. Formulate this problem as a LPP to maximize the profit to the company.
Let’s assume x and y to be the number of sweaters of type A and type B respectively. From the question, the following constraints are: \[360x\text{ }+\text{ }120y\le 72000\Rightarrow 3x\text{...
A company manufactures two types of screws A and B. All the screws have to pass through a threading machine and a slotting machine. A box of Type A screws requires
minutes on the threading machine and
minutes on the slotting machine. A box of type B screws requires
minutes of threading on the threading machine and
minutes on the slotting machine. In a week, each machine is available for
hours. On selling these screws, the company gets a profit of Rs
per box on type A screws and Rs 170 per box on type B screws. Formulate this problem as a LPP given that the objective is to maximize profit.
Let’s consider that the company manufactures x boxes of type A screws and y boxes of type B screws. From the given information the below table is constructed: From the data in the above table, the...
A firm has to transport
packages using large vans which can carry
packages each and small vans which can take
packages each. The cost for engaging each large van is Rs
and each small van is Rs
. Not more than Rs
is to be spent on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost.
Let us consider x and y to be the number of large and small vans respectively. From the given information the below constrains table is constructed: Now, the objective function for minimum cost is...
A manufacturer of electronic circuits has a stock of
resistors,
transistors and
capacitors and is required to produce two types of circuits A and B. Type A requires
resistors,
transistors and
capacitors. Type B requires
resistors,
transistors and
capacitors. If the profit on type A circuit is Rs
and that on type B circuit is Rs
, formulate this problem as a LPP so that the manufacturer can maximize his profit.
Let x units of type A and y units of type B electric circuits be produced by the manufacturer. From the given information the below table is constructed: Now, the total profit function in rupees...
In Fig. 12.11, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of
From the given figure, it’s seen that the corner points are as follows: \[R\left( 7/2,\text{ }3/4 \right),\text{ }Q\left( 3/2,\text{ }15/4 \right),\text{ }P\left( 3/13,\text{ }24/13 \right)\text{...
The feasible region for a LPP is shown in Fig. 12.10. Evaluate
at each of the corner points of this region. Find the minimum value of Z, if it exists.
According to the question: \[\mathbf{Z}\text{ }=\text{ }\mathbf{4}x~+~y\] In the given figure, ABC is the feasible region which is open unbounded. Here, we have \[x\text{ }+\text{ }y\text{ }=\text{...
Refer to Exercise 7 above. Find the maximum value of Z.
In the evaluating table for the value of Z, it’s clearly seen that the maximum value of Z is \[47\] at \[(3,2)\]
The feasible region for a LPP is shown in Fig. 12.9. Find the minimum value of
.
In the given figure, it’s seen that the feasible region is ABCA. The corner points are \[C\left( 0,\text{ }3 \right),\text{ }B\left( 0,\text{ }5 \right)\]’and for A, we have to solve equations...
Feasible region (shaded) for a LPP is shown in Fig. 12.8. Maximize
.
According to the question: \[\mathbf{Z}\text{ }=\text{ }\mathbf{5}x~+\text{ }\mathbf{7}y\] and feasible region OABC. The corner points of the feasible region are \[O\left( 0,\text{ }0 \right),\text{...
Determine the maximum value of
if the feasible region (shaded) for a LPP is shown in Fig.
.
As shown in the figure, OAED is the feasible region. At A, \[y\text{ }=\text{ }0\]in equation \[2x\text{ }+\text{ }y\text{ }=\text{ }104\]we get, \[x=52\] This is a corner point \[A\text{ }=\text{...
Minimize
subject to the constraints:
.
According to the question: \[\mathbf{Z}\text{ }=\text{ }\mathbf{13}x~\text{ }\mathbf{15}y~\]and the constraints \[x~+~y~\text{£}\text{ }\mathbf{7},\text{ }\mathbf{2}x~\text{ }\mathbf{3}y~+\text{...
Maximize the function
, subject to the constraints:
.
According to the question: \[\mathbf{Z}\text{ }=\text{ }\mathbf{11}x~+\text{ }\mathbf{7}y\]and the constraints \[x~\text{£}\text{ }\mathbf{3},~y~\text{£}\text{ }\mathbf{2},~x~{}^\text{3}\text{...
Maximize
, subject to the constraints:
.
According to the question: \[\mathbf{Z}\text{ }=\text{ }\mathbf{3}x~+\text{ }\mathbf{4}y\] and the constraints \[x~+~y~\text{£}\text{ }\mathbf{1},~x~{}^\text{3}\text{...
Determine the maximum value of
subject to the constraints:
.
According to the question: \[\mathbf{Z}\text{ }=\text{ }\mathbf{11}x~+\text{ }\mathbf{7}y~\]and the constraints \[\mathbf{2}x~+~y~\text{£}\text{ }\mathbf{6},~x~\text{£}\text{...