हिंदी

A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available pe

Advertisements
Advertisements

प्रश्न

A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 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 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.

सारिणी
योग
Advertisements

उत्तर

Let x and y be the number of Models of bike produced by the manufacturer.

Given information is

Model X takes 6 man-hours to make per unit

Model Y takes 10 man-hours to make per unit

Total man-hours available = 450

∴ 6x + 10y ≤ 450

⇒ 3x + 5y ≤ 225  ......(i)

Handling and marketing cost of Model X and Y are ₹ 2,000 and ₹ 1,000 respectively

Total funds available is ₹ 80,000 per week

∴ 2000x + 1000y ≤ 80,000

⇒ 2x + y ≤ 80   ......(ii)

And x ≥ 80, y ≥ 0

Profit (Z) per unit of models X and Y are ₹ 1,000 and ₹ 500 respectively

So, Z = 1000x + 500y

The required LPP is

Maximise Z = 1000x + 500y subject to the constraints

3x + 5y ≤ 225  .......(i)

x 0 75
y 45 0

2x + y ≤ 80  ......(ii)

x 0 40
y 80 0

x ≥ 0, y ≥ 0  ......(iii)

On solving equation (i) and (ii)

We get, x = 25, y = 30

Here, the feasible region is OABC

Whose corner points are O(0, 0), A(40, 0), B(25, 30) and C(0, 45).

Let us evaluate the value of Z.

Corner points Value of Z = 1000x + 500y  
O(0, 0) Z = 0 + 0 = 0  
A(40, 0) Z = 1000(40) + 0 = 40,000 ← Maximum
B(25, 30) Z = 1000(25) + 500(30) = 40,000 ← Maximum
C(0, 45) Z = 0 + 500(45) = 22500  

Hence, the maximum profit is ₹ 40,000 by producing 25 bikes of Model X and 30 bikes of Model Y.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Linear Programming - Exercise [पृष्ठ २५३]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 12
अध्याय 12 Linear Programming
Exercise | Q 22 | पृष्ठ २५३

वीडियो ट्यूटोरियलVIEW ALL [2]

संबंधित प्रश्न

Solve the following Linear Programming Problems graphically:

Minimise Z = – 3x + 4 y

subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Minimise Z = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.


Show that the minimum of Z occurs at more than two points.

Minimise and Maximise Z = 5x + 10 y

subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.


Show that the minimum of Z occurs at more than two points.

Maximise Z = – x + 2y, Subject to the constraints:

x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.


Show that the minimum of Z occurs at more than two points.

Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.


A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:

Type of toy Machines
I II III
A 12 18 6
B 6 0 9

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.

 


To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
 

  Food I
(per lb)
  Food II
(per lb)
    Minimum daily requirement
for the nutrient
 Calcium 10   5     20
Protein 5   4     20
 Calories 2   6     13
 Price (Rs) 60   100      


What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.


The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region


Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0


The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y


A company makes 3 model of calculators: A, B and C at factory I and factory II. The company has orders for at least 6400 calculators of model A, 4000 calculator of model B and 4800 calculator of model C. At factory I, 50 calculators of model A, 50 of model B and 30 of model C are made every day; at factory II, 40 calculators of model A, 20 of model B and 40 of model C are made everyday. It costs Rs 12000 and Rs 15000 each day to operate factory I and II, respectively. Find the number of days each factory should operate to minimise the operating costs and still meet the demand.


The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.


Refer to Question 27. Maximum of Z occurs at ______.


Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.


Refer to Question 30. Minimum value of F is ______.


In a LPP, the linear inequalities or restrictions on the variables are called ____________.


A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.


The feasible region for an LPP is always a ______ polygon.


If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.


Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.


In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.


In a LPP, the maximum value of the objective function Z = ax + by is always finite.


Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?


For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:


In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:


Objective function of a linear programming problem is ____________.


The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.


A maximum or a minimum may not exist for a linear programming problem if ____________.


In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.


Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.


The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×