हिंदी
तमिलनाडु बोर्ड ऑफ सेकेंडरी एज्युकेशनएचएससी वाणिज्य कक्षा ११

In the given graph the coordinates of M1 are - Business Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

In the given graph the coordinates of M1 are

विकल्प

  • x1 = 5, x2 = 30

  • x1 = 20, x2 = 16

  • x1 = 10, x2 = 20

  • x1 = 20, x2 = 30

MCQ
Advertisements

उत्तर

x1 = 10, x2 = 20

Explanation:

4x1 + 2x2 = 80 (or) 2x1 + x2 = 40

2x1 + x2 = 40 ……(1)

2x1 + 5x2 = 120 ……(2)
− 4x2 = − 80 ........[Equation (1) – (2)]

x2 = 20

But, 2x1 + x2 = 40

2x1 + 20 = 20

x1 = 10

shaalaa.com
Linear Programming Problem (L.P.P.)
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 10: Operations Research - Exercise 10.3 [पृष्ठ २५१]

APPEARS IN

सामाचीर कलवी Business Mathematics and Statistics [English] Class 11 TN Board
अध्याय 10 Operations Research
Exercise 10.3 | Q 7 | पृष्ठ २५१

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

The maximum value of z = 5x + 3y subject to the constraints 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is ______.


The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at


Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points


x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?


The variables involved in LPP are called ______


A company manufactures two models of voltage stabilizers viz., ordinary and auto-cut. All components of the stabilizers are purchased from outside sources, assembly and testing is carried out at the company’s own works. The assembly and testing time required for the two models are 0.8 hours each for ordinary and 1.20 hours each for auto-cut. Manufacturing capacity 720 hours at present is available per week. The market for the two models has been surveyed which suggests a maximum weekly sale of 600 units of ordinary and 400 units of auto-cut. Profit per unit for ordinary and auto-cut models has been estimated at ₹ 100 and ₹ 150 respectively. Formulate the linear programming problem.


Solve the following linear programming problems by graphical method.

Maximize Z = 20x1 + 30x2 subject to constraints 3x1 + 3x2 ≤ 36; 5x1 + 2x2 ≤ 50; 2x1 + 6x2 ≤ 60 and x1, x2 ≥ 0.


A solution which maximizes or minimizes the given LPP is called


Solve the following problems by graphical method:

Maximize z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0 y ≥ 0


Find graphical solution for the following system of linear in equation:

x + 2y ≥ 4, 2x - y ≤ 6


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×