हिंदी

HSC Commerce (Marathi Medium) १२ वीं कक्षा - Maharashtra State Board Question Bank Solutions

Advertisements
[object Object]
[object Object]
विषयों
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  1541 to 1560 of 1876  next > 

Choose the correct alternative:

The maximum value of Z = 3x + 5y subjected to the constraints x + y ≤ 2, 4x + 3y ≤ 12, x ≥ 0, y ≥ 0 is

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

Choose the correct alternative:

The minimum value of Z = 4x + 5y subjected to the constraints x + y ≥ 6, 5x + y ≥ 10, x, y ≥ 0 is

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

Advertisements

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

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

Choose the correct alternative:

The point at which the maximum value of Z = 4x + 6y subject to the constraints 3x + 2y ≤ 12, x + y ≥ 4, x ≥ 0, y ≥ 0 is obtained at the point

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

Choose the correct alternative:

The corner points of feasible region for the inequations, x + y ≤ 5, x + 2y ≤ 6, 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, 3), (3, 0), (8, 0), `(12/5, 38/5)` and (0, 10), then the point of maximum Z = 6x + 4y = 48 is at

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

Choose the correct alternative:

The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at

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

State whether the following statement is True or False:

The maximum value of Z = 5x + 3y subjected to constraints 3x + y ≤ 12, 2x + 3y ≤ 18, 0 ≤ x, y is 20

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

State whether the following statement is True or False:

If LPP has two optimal solutions, then the LPP has infinitely many solutions

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

State whether the following statement is True or False:

A convex set includes the points but not the segment joining the points

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

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

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

State whether the following statement is True or False:

If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)

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

State whether the following statement is True or False:

Corner point method is most suitable method for solving the LPP graphically

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

State whether the following statement is True or False:

Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region

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

State whether the following statement is True or False:

The point (6, 4) does not belong to the feasible region bounded by 8x + 5y ≤ 60, 4x + 5y ≤ 40, 0 ≤ x, y

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

State whether the following statement is True or False:

The graphical solution set of the inequations 0 ≤ y, x ≥ 0 lies in second quadrant

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

A set of values of variables satisfying all the constraints of LPP is known as ______

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

The feasible region represented by the inequations x ≥ 0, y ≤ 0 lies in ______ quadrant.

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

If the feasible region is bounded by the inequations 2x + 3y ≤ 12, 2x + y ≤ 8, 0 ≤ x, 0 ≤ y, then point (5, 4) is a ______ of the feasible region

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

A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined
< prev  1541 to 1560 of 1876  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×