For a Linear Programming Problem (LPP), the given objective function \( Z = 3x + 2y \) is subject to constraints: \[ x + 2y \leq 10, \] \[ 3x + y \leq 15, \] \[ x, y \geq 0. \] 
The correct feasible region is:
The feasible region of a Linear Programming Problem (LPP) is determined by the intersection of the inequalities.
The feasible region is the set of points that satisfy all the constraints.
- Plot the given constraints on a coordinate plane:
1. \( x + 2y = 10 \) is a straight line.
2. \( 3x + y = 15 \) is another straight line.
3. \( x, y \geq 0 \) represents the first quadrant.
- The feasible region will be bounded by the lines and will be the area that satisfies all these constraints.
From the diagram, the feasible region is the region enclosed by the points \( A, O, E, C \), and the correct region is \( AOEC \).
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Reshma wishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture contain at least 8 units of vitamin A and 11 units of vitamin B.Food P costs Rs.60/kg and food Q costs Rs.80/kg. Food P contains 3 units/kg of vitamin A and 5 units/kg of vitamin B while food Q contains 4units/kg of vitamin A and 2 units/kg of vitamin B. Determine the minimum cost of the mixture.
One kind of cake requires 200g of flour and 25g of fat, and another kind of cake requires 100g of flour and 50g of fat. Find the maximum number of cakes that can be made from 5kg of flour and 1kg of fat assuming that there is no shortage of the other ingredients used in making the cakes.
A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3 hours on machine B to produce a package of nuts. It takes 3 hours on machine A and 1 hour on machine B to produce a package of bolts. He earns a profit of Rs17.50 per package on nuts and Rs7.00 per package on bolts. How many packages of each should be produced each day so as to maximize his profit, if he operates his machines for at the most 12 hours a day?