मराठी

HSC Commerce (English Medium) इयत्ता १२ वी - Maharashtra State Board Important Questions for Mathematics and Statistics

Advertisements
[object Object]
[object Object]
विषय
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics and Statistics
< prev  401 to 420 of 472  next > 

Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Choose the correct alternative:

The feasible region is

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Linear Programming Problem (L.P.P.)

Choose the correct alternative:

The point at which the minimum value of Z = 8x + 12y subject to the constraints 2x + y ≥ 8, x + 2y ≥ 10, x ≥ 0, y ≥ 0 is obtained at the point

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Choose the correct alternative:

The corner points of feasible region for the inequations, x + y ≤ 5, x + 2y ≤ 6, x ≥ 0, y ≥ 0 are

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

State whether the following statement is True or False:

If the corner points of the feasible region are `(0, 7/3)`, (2, 1), (3, 0) and (0, 0), then the maximum value of Z = 4x + 5y is 12

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

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 ______

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Introduction of Linear Programming

Heramb requires at most 400 calories from his breakfast. Every morning he likes to take oats and milk. If each bowl of oats and a glass of milk provides him 80 calories and 50 calories respectively, then as a constraint this information can be expressed as ______

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Introduction of Linear Programming

Smita is a diet conscious house wife, wishes to ensure certain minimum intake of vitamins A, B and C for the family. The minimum daily needs of vitamins A, B, and C for the family are 30, 20, and 16 units respectively. For the supply of the minimum vitamin requirements Smita relies on 2 types of foods F1 and F2. F1 provides 7, 5 and 2 units of A, B, C vitamins per 10 grams and F2 provides 2, 4 and 8 units of A, B and C vitamins per 10 grams. F1 costs ₹ 3 and F2 costs ₹ 2 per 10 grams. How many grams of each F1 and F2 should buy every day to keep her food bill minimum

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Minimize Z = 2x + 3y subject to constraints

x + y ≥ 6, 2x + y ≥ 7, x + 4y ≥ 8, x ≥ 0, y ≥ 0

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Solve the following LPP graphically:

Maximize Z = 9x + 13y subject to constraints

2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0

Solution: Convert the constraints into equations and find the intercept made by each one of it.

Inequation Equation X intercept Y intercept Region
2x + 3y ≤ 18 2x + 3y = 18 (9, 0) (0, ___) Towards origin
2x + y ≤ 10 2x + y = 10 ( ___, 0) (0, 10) Towards origin
x ≥ 0, y ≥ 0 x = 0, y = 0 X axis Y axis ______

The feasible region is OAPC, where O(0, 0), A(0, 6),

P( ___, ___ ), C(5, 0)

The optimal solution is in the following table:

Point Coordinates Z = 9x + 13y Values Remark
O (0, 0) 9(0) + 13(0) 0  
A (0, 6) 9(0) + 13(6) ______  
P ( ___,___ ) 9( ___ ) + 13( ___ ) ______ ______
C (5, 0) 9(5) + 13(0) ______  

∴ Z is maximum at __( ___, ___ ) with the value ___.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Solve the following LP.P.

Maximize z = 13x + 9y,

Subject to 3x + 2y ≤ 12,

x + y ≥ 4,

x ≥ 0,

y ≥ 0.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Linear Programming Problem (L.P.P.)

The set of feasible solutions of LPP is a ______.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Linear Programming Problem (L.P.P.)

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

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Introduction of Linear Programming

Shraddho wants to invest at most ₹ 25,000/- in saving certificates and fixed deposits. She wants to invest at least ₹ 10,000/- in saving certificate and at least ₹ 15,000/- in fixed deposits. The rate of interest on saving certificate is 5% and that on fixed deposits is 7% per annum. Formulate the above problem as LPP to determine maximum income yearly.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

Solution which satisfy all constraints is called ______ solution.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Linear Programming Problem (L.P.P.)

Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Mathematical Formulation of Linear Programming Problem

A job production unit has four jobs A, B, C, D which can be manufactured on each of the four machines P, Q, R and S. The processing cost of each job is given in the following table:

         Jobs

 

 

                          Machines

P

Q

R

S

                Processing Cost (Rs.)

 

A

31

25

33

29

B

25

24

23

21

C

19

21

23

24

D

38

36

34

40

 How should the jobs be assigned to the four machines so that the total processing cost is minimum?

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Solve the following minimal assignment problem and hence find the minimum value : 

  I II III IV
A 2 10 9 7
B 13 2 12 2
C 3 4 6 1
D 4 15 4 9

 

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Suggest optimum solution to the following assignment. Problem, also find the total minimum service time.
                                             Service Time ( in hrs.)

Counters Salesmen
A B C D
W 41 72 39 52
X 22 29 49 65
Y 27 39 60 51
Z 45 50 48 52
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Solve the following minimal assignment problem : 

Machines A B C D E
M1 27 18 20 21
M2 31 24 21 12 17
M3 20 17 20 16
M4 21 28 20 16 27
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem
< prev  401 to 420 of 472  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×