मराठी

HSC Commerce: Marketing and Salesmanship इयत्ता १२ वी - Maharashtra State Board Question Bank Solutions

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

Please select a subject first

Advertisements
Advertisements
< prev  4821 to 4840 of 7775  next > 

Cyclical variation can occur several times in a year.

[12] Time Series
Chapter: [12] Time Series
Concept: undefined >> undefined

Irregular variation is not a random component of time series.

[12] Time Series
Chapter: [12] Time Series
Concept: undefined >> undefined

Advertisements

Solve the following LPP by graphical method:

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

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

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

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

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

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

Maximize: Z = 10x + 25y
subject to 0 ≤ x ≤ 3,
0 ≤ y ≤ 3,
x + y ≤ 5.
Also find the maximum value of z.

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

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

Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.

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

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

Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.

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

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

Minimize: Z = 6x + 2y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.

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

Choose the correct alternative:

The value of objective function is maximize under linear constraints.

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

Choose the correct alternative :

The maximum value of z = 5x + 3y. subject to the constraints

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

Choose the correct alternative :

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

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

Choose the correct alternative :

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

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

Fill in the blank :

Graphical solution set of the in equations x ≥ 0, y ≥ 0 is in _______ quadrant

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

Fill in the blank :

The region represented by the in equations x ≤ 0, y ≤ 0 lines in _______ quadrants.

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

The region represented by the inequality y ≤ 0 lies in _______ quadrants.

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

The constraint that a factory has to employ more women (y) than men (x) is given by _______

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

The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.

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

State whether the following is True or False :

The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.

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

Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.

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

Solve the following problem :

Maximize Z = 5x1 + 6x2 Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, x2 ≥ 0

[14] Linear Programming
Chapter: [14] Linear Programming
Concept: undefined >> undefined
< prev  4821 to 4840 of 7775  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×