A company manufactures two types of novelty s | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Let the company manufacture $x$ souvenirs of type $A$ and $y$ souvenirs of type $B$.The given information can be compiled in a table as follows:Pr

Vedclass · Accepted Answer

$8$ of type $A$ and $20$ of type $B$

Vedclass · Answer

(A) Let the company manufacture $x$ souvenirs of type $A$ and $y$ souvenirs of type $B$.The given information can be compiled in a table as follows:ProcessType $A$Type $B$AvailabilityCutting (min)$5$$8$$200$Assembling (min)$10$$8$$240$The constraints are:$5x + 8y \leq 200$$10x + 8y \leq 240 \implies 5x + 4y \leq 120$$x, y \geq 0$Objective function to maximize profit $Z = 5x + 6y$.The feasible region is bounded by the corner points $O(0,0)$,$A(24,0)$,$B(8,20)$,and $C(0,25)$.Evaluating $Z$ at corner points:Corner Point$Z = 5x + 6y$$A(24,0)$$5(24) + 6(0) = 120$$B(8,20)$$5(8) + 6(20) = 40 + 120 = 160$$C(0,25)$$5(0) + 6(25) = 150$The maximum profit is $Rs. 160$ at $(8, 20)$. Thus,the company should manufacture $8$ souvenirs of type $A$ and $20$ souvenirs of type $B$.

From/To	$A$	$B$	$C$
$P$	$160$	$100$	$150$
$Q$	$100$	$120$	$100$

Similar Questions

Cake-$A$ requires $200\, g$ of flour and $25\, g$ of fat. Cake-$B$ requires $100\, g$ of flour and $50\, g$ of fat. Find the maximum number of cakes which can be made from $5\, kg$ of flour and $1\, kg$ of fat. The mathematical form of this $LPP$ is $.....$

The shaded part of the given figure indicates the feasible region. Then the constraints are

The function to be maximized is given by $Z=3x+2y$. The feasible region for this function is the shaded region shown in the figure. The linear constraints for this region are given by:

The maximum value of $Z = 5x + 2y$,subject to the constraints $2x - y \geq 2$,$x + 2y \leq 8$,and $x, y \geq 0$,is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module