English

HSC Commerce (English Medium) 12th Standard Board Exam - Maharashtra State Board Question Bank Solutions for Mathematics and Statistics

Advertisements
Subjects
Topics
Subjects
Popular subjects
Topics
Advertisements
Advertisements
Mathematics and Statistics
< prev  641 to 660 of 1916  next > 

Choose the correct alternative :

Of all the points of the feasible region the optimal value of z is obtained at a point

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Choose the correct alternative :

Feasible region; the set of points which satify.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Advertisements

Choose the correct alternative :

Solution of LPP to minimize z = 2x + 3y st. x ≥ 0, y ≥ 0, 1≤ x + 2y ≤ 10 is

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Choose the correct alternative :

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Choose the correct alternative :

The half plane represented by 4x + 3y ≥ 14 contains the point

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

The optimal value of the objective function is attained at the ______ points of the feasible region.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Fill in the blank :

“A gorage employs eight men to work in its shownroom and repair shop. The constraints that there must be at least 3 men in showroom and at least 2 men in repair shop are ______ and _______ respectively.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

Fill in the blank :

A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

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.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

State whether the following is True or False :

The point (1, 2) is not a vertex of the feasible region bounded by 2x + 3y ≤ 6, 5x + 3y ≤ 15, x ≥ 0, y ≥ 0.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

State whether the following is True or False :

The feasible solution of LPP belongs to only quadrant I.

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined

The Cost of Living Index Number using Weighted Relative Method is given by ______

[13] Index Numbers
Chapter: [13] Index Numbers
Concept: undefined >> undefined

The Assignment Problem is solved by ______.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

To use the Hungarian method, a profit maximization assignment problem requires ______.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Choose the correct alternative :

Using Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:

Agent Job
A B C D
1 10 12 15 25
2 14 11 19 32
3 18 21 23 29
4 15 20 26 28
[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

For solving an assignment problem the matrix should be a _______ matrix.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined
< prev  641 to 660 of 1916  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×