मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी वाणिज्य (इंग्रजी माध्यम) इयत्ता १२ वी

A train carries at least twice as many first class passengers (y) as second class passengers (x). The constraint is given by ______. - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

A train carries at least twice as many first class passengers (y) as second class passengers (x). The constraint is given by ______.

रिकाम्या जागा भरा
Advertisements

उत्तर

A train carries at least twice as many first class passengers (y) as second class passengers (x). The constraint is given by x ≥ 2y.

shaalaa.com
Linear Programming Problem (L.P.P.)
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 6: Linear Programming - Miscellaneous Exercise 6 [पृष्ठ १०३]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
पाठ 6 Linear Programming
Miscellaneous Exercise 6 | Q 2.7 | पृष्ठ १०३

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

Find the feasible solution of the following inequation:

3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.


Find the feasible solution of the following inequation:

x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9,  x ≥ 0, y ≥ 0.


Solve the following LPP by graphical method:

Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0


Select the appropriate alternatives for each of the following question:

The value of objective function is maximum under linear constraints


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


If the corner points of the feasible solution are (0, 0), (3, 0), (2, 1), `(0, 7/3)` the maximum value of z = 4x + 5y is ______.


Sketch the graph of the following inequation in XOY co-ordinate system:

|x + 5| ≤ y


Solve the following L.P.P. by graphical method:

Maximize: Z = 4x + 6y

Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.


Choose the correct alternative :

Which of the following is correct?


Choose the correct alternative :

The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are


Choose the correct alternative :

The corner points of the feasible region are (0, 0), (2, 0), `(12/7, 3/7)` and (0,1) then the point of maximum z = 7x + y


Choose the correct alternative :

The half plane represented by 3x + 2y ≤ 0 constraints the point.


State whether the following is True or False :

Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.


The feasible region is the set of point which satisfy.


Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0


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


A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.


A company produces two types of products say type A and B. Profits on the two types of product are ₹ 30/- and ₹ 40/- per kg respectively. The data on resources required and availability of resources are given below.

  Requirements Capacity available per month
Product A Product B
Raw material (kgs) 60 120 12000
Machining hours/piece 8 5 600
Assembling (man hours) 3 4 500

Formulate this problem as a linear programming problem to maximize the profit.


Solve the following linear programming problems by graphical method.

Maximize Z = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.


Solve the following linear programming problems by graphical method.

Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.


A solution which maximizes or minimizes the given LPP is called


The minimum value of the objective function Z = x + 3y subject to the constraints 2x + y ≤ 20, x + 2y ≤ 20, x > 0 and y > 0 is


A firm manufactures pills in two sizes A and B. Size A contains 2 mgs of aspirin, 5 mgs of bicarbonate and 1 mg of codeine. Size B contains 1 mg. of aspirin, 8 mgs. of bicarbonate and 6 mgs. of codeine. It is found by users that it requires at least 12 mgs. of aspirin, 74 mgs. of bicarbonate and 24 mgs. of codeine for providing immediate relief. It is required to determine the least number of pills a patient should take to get immediate relief. Formulate the problem as a standard LLP.


Solve the following linear programming problem graphically.

Maximise Z = 4x1 + x2 subject to the constraints x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1 ≥ 0, x2 ≥ 0.


Solve the following LPP by graphical method:

Maximize: z = 3x + 5y Subject to:  x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0


Solve the following LPP:

Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


Sketch the graph of the following inequation in XOY co-ordinate system.

2y - 5x ≥ 0


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×