हिंदी

The Optimal Value of the Objective Function is Attained at the Points (A) Given by Intersection of Inequations with the Axes Only (B) Given by Intersection of Inequations with X-axis Only

Advertisements
Advertisements

प्रश्न

The optimal value of the objective function is attained at the points

विकल्प

  • given by intersection of inequations with the axes only

  •  given by intersection of inequations with x-axis only

  •  given by corner points of the feasible region

  •  none of these

     
MCQ
Advertisements

उत्तर

given by corner points of the feasible region

It is known that the optimal value of the objective function is attained at any of the corner point.
Thus, the optimal value of the objective function is attained at the points given by corner points of the feasible region.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 29: Linear programming - MCQ [पृष्ठ ६७]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
अध्याय 29 Linear programming
MCQ | Q 6 | पृष्ठ ६७

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

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

A company is making two products A and B. The cost of producing one unit of products A and B are Rs 60 and Rs 80 respectively. As per the agreement, the company has to supply at least 200 units of product B to its regular customers. One unit of product  A  requires one machine hour whereas product B has machine hours available abundantly within the company. Total machine hours available for product A are 400 hours. One unit of each product A and B requires one labour hour each and total of 500 labour hours are available. The company wants to minimize the cost of production by satisfying the given requirements. Formulate the problem as a LPP.


A firm manufactures two types of products A and B and sells them at a profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2. Type A requires one minute of processing time on M1 and two minutes of M2; type B requires one minute on M1 and one minute on M2. The machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP.


A manufacturer can produce two products, A and B, during a given time period. Each of these products requires four different manufacturing operations: grinding, turning, assembling and testing. The manufacturing requirements in hours per unit of products A and B are given below.

  A B
Grinding 1 2
Turning 3 1
Assembling 6 3
Testing 5 4


The available capacities of these operations in hours for the given time period are: grinding 30; turning 60, assembling 200; testing 200. The contribution to profit is Rs 20 for each unit of A and Rs 30 for each unit of B. The firm can sell all that it produces at the prevailing market price. Determine the optimum amount of A and B to produce during the given time period. Formulate this as a LPP.


A firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost of engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost


The solution set of the inequation 2x + y > 5 is


Objective function of a LPP is


The maximum value of Z = 4x + 2y subjected to the constraints 2x + 3y ≤ 18, x + y ≥ 10 ; xy ≥ 0 is


Consider a LPP given by
Minimum Z = 6x + 10y
Subjected to x ≥ 6; y ≥ 2; 2x + y ≥ 10; xy ≥ 0
Redundant constraints in this LPP are 


If the constraints in a linear programming problem are changed


Feasible region is the set of points which satisfy ______.


State whether the following is True or False:

The optimum value of the objective function of LPP occurs at the centre of the feasible region.


Choose the correct alternative:

How does a constraint, “A washing machine can hold up to 8 kilograms of cloths (X)” can be given?


State whether the following statement is True or False:

The half-plane represented by 3x + 4y ≥ 12 includes the point (4, 3)


By spending almost ₹ 250, Rakhi bought some kg grapes (x) and some dozens of bananas (y), then as a constraint this information can be expressed by ______


A doctor prescribed 2 types of vitamin tablets, T1 and T2 for Mr. Dhawan. The tablet T1 contains 400 units of vitamin and T2 contains 250 units of vitamin. If his requirement of vitamin is at least 4000 units, then the inequation for his requirement will be ______


Ganesh owns a godown used to store electronic gadgets like refrigerator (x) and microwave (y). If the godown can accommodate at most 75 gadgets, then this can be expressed as a constraint by ______


Determine the maximum value of Z = 4x + 3y if the feasible region for an LPP is shown in figure


Determine the minimum value of Z = 3x + 2y (if any), if the feasible region for an LPP is shown in Figue.


A manufacturing company makes two types of television sets; one is black and white and the other is colour. The company has resources to make at most 300 sets a week. It takes Rs 1800 to make a black and white set and Rs 2700 to make a coloured set. The company can spend not more than Rs 648000 a week to make television sets. If it makes a profit of Rs 510 per black and white set and Rs 675 per coloured set, how many sets of each type should be produced so that the company has maximum profit? Formulate this problem as a LPP given that the objective is to maximise the profit.


Minimise Z = 3x + 5y subject to the constraints:
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
x, y ≥ 0


Feasible region (shaded) for a LPP is shown in the Figure Minimum of Z = 4x + 3y occurs at the point ______.


A type of problems which seek to maximise (or, minimise) profit (or cost) form a general class of problems called.


Conditions under which the object function is to be maximum or minimum are called ______.


What is defined as a problem in which a linear objective function is to be maximised or minimised subject to a set of linear constraints and non-negative conditions on the variables?


An optimisation problem becomes a Linear Programming Problem (LPP) when:


What is the correct sequential order of steps to formulate and solve a 2-variable Linear Programming Problem?


A furniture dealer invests in tables (\[x\]) and chairs (\[y\]). He has \[\text{Rs } 50,000\] to invest and storage space for at most \[60\] pieces. A table costs \[\text{Rs } 2500\] and gives a profit of \[\text{Rs } 250\], while a chair costs \[\text{Rs } 500\] and gives a profit of \[\text{Rs } 75\]. What is the objective function to maximise total profit \[Z\]?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×