Question:

A factory owner wants to purchase two types of machines, $A$ and $B$, for his factory. The machine $A$ requires an area of $1000 m^2$ and $12$ skilled men for running it and its daily output is $ 50$ units, whereas the machine $B$ required $1200m^ 2$ area and $8$ skilled men, and its daily output is $40$ units. If an area of $7600 m^2$ and $72$ skilled men be available to operate the machine, how many machines $A$ and $B$ respectively should be purchased to maximize the daily output?

Updated On: Jul 5, 2022
  • $4,3 $
  • $2,6$
  • $6,2$
  • $3, 4$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Let the number of machine $A$ be $x$ and number of machine $B$ be $y$. Let $z$ be the daily output. Now given information can be summarized as : According to question, $x$ and $y$ must satisfy the following conditions: (Area) $1000x + 1200y \le 7600 \Rightarrow 5x + 67 \le 38$ (Man power) $12 x + 87 \le 72 \Rightarrow 3x + 27 \le 18$ $ x \ge 0,y \ge 0$ Mathematical formulation of the $LPP$ is Maximize $z = 50x + 40y$ subject to constraints : $5x + 67 \le 38,3x + 27 \le 18, x\ge 0, y \ge 0$ Now, we draw the lines $l_1 : 5x + 67 = 38$ $ l_2: 3x + 2y= 18$ $ l_3 : x = 0$ and $l_4 :7 = 0$ Lines $l_1$ and $l_2$ meet at $E(4, 3)$.
The shaded region $OCEB$ is the feasible region which is bounded. Vertices of the feasible region are $0(0,0), C(6,0), E(4,3)$ and $B\left(0, \frac{19}{3}\right)$ Maximize $z = 50x + 40y$ At $0, z = 50 \times 0 + 40 \times 0 = 0$ At $C, z = 50 \times 6 + 40 \times 0 = 300$ At $E,z= 50 \times 4 + 40 \times 3 = 320$ At $B, z = 50 \times 0 + 40 \times {\frac{19}{3}} = 253.33$ Clearly, the maximum output $= 320$ is at $E(4, 3)$, i.e., when $4$ machines $A$ and $3$ machines $B$ are purchased.
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.