Question:

A dealer wishes to purchase a number of fans and sewing machines. He has only $?\, 5760$ to invest and has space for at most $20$ items. A fan and sewing machine cost $?\, 360$ and $? \,240$ respectively. He can sell a fan at a profit of $?\,22$ and sewing machine at a profit of $? \,18$. Assuming that he can sell whatever he buys, how many fans and sewing machines respectively he sell in order to maximize his profit?

Updated On: Jul 5, 2022
  • $8, 12$
  • $6, 10$
  • $10, 6$
  • $12, 8$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Let the dealer purchase $x$ fans and $y$ sewing machines. Then, the profit function $z$ is given by $z = 22x + 18y$ The two variables $x$ and $y$ satisfy following constraints : $360x + 240y \le 5760$ or $3x + 2y\le 48$ $ x + y \le 20, x \ge 0, y \ge 0$ Hence mathematical formulation of the given $LPP$ is : Maximize $z = 22x + 18y$ subject to constraints : $3x + 2y \le 48 $ $x + y \le 20$ $x \le 0,7 \ge 0$
Now we draw the lines $ l_1 : 3x + 2y = 48$ $l_2 : x + y = 20 $ $l_3: x = 0, l_4 : y = 0$ Lines $l_1$ and $l_2$ intersect at $P( 8,12)$. The shaded region $OAPD$ represents the feasible region, which is bounded. Vertices of the feasible region are $O(0, 0), A(16,0), P(8, 12)$ and $D(0, 20)$ Since, maximize $z = 22x + 18y$ $\therefore$ At $O(0, 0), z = 0$ At $A(16, 0), z = 22 \times 16+ 18 \times 0 = 352$ At $P(8,12), z = 22\times 8 + 18 \times 12 = 392$ At $D(0, 20), z = 22 \times 0 + 18 \times 20 = 360$ Thus profit is maximum at $P(8, 12)$. Hence, profit is maximum when $8$ fans and $12$ sewing machines are purchased and sold and the maximum profit is $?\, 392$.
Was this answer helpful?
0
0

Concepts Used:

Linear Programming

Linear programming is a mathematical technique for increasing the efficiency and effectiveness of operations under specific constraints. The main determination of linear programming is to optimize or minimize a numerical value. It is built of linear functions with linear equations or inequalities restricting variables.

Characteristics of Linear Programming:

  • Decision Variables: This is the first step that will determine the output. It provides the final solution to the problem.
  • Constraints: The mathematical form in which drawbacks are expressed, regarding the resource.
  • Data: They are placeholders for known numbers to make writing complex models simple. They are constituted by upper-case letters.
  • Objective Functions: Mathematically, the objective function should be quantitatively defined.
  • Linearity: The function's relation between two or more variables must be straight. It indicates that the variable's degree is one.
  • Finiteness: Input and output numbers must be finite and infinite. The best solution is not possible if the function consists infinite components.
  • Non-negativity: The value of the variable should be either positive (+ve) or 0. It can't be a negative (-ve) number.