हिंदी

Science (English Medium) कक्षा १२ - CBSE Question Bank Solutions for Mathematics

Advertisements
[object Object]
[object Object]
विषयों
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics
< prev  4441 to 4460 of 8859  next > 

Refer to Question 27. Maximum of Z occurs at ______.

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

Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.

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

Advertisements

The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.

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

Refer to Question 30. Minimum value of F is ______.

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

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at  ______.

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

Refer to Question 32, Maximum of F – Minimum of F = ______.

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

In a LPP, the linear inequalities or restrictions on the variables are called ____________.

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

In a LPP, the objective function is always ______.

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

If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.

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

In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.

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

A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.

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

A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.

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

The feasible region for an LPP is always a ______ polygon.

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

If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.

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

Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.

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

In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.

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

In a LPP, the maximum value of the objective function Z = ax + by is always finite.

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

If `[(2"a"+"b", "a"-2"b"),(5"c" - "d", 4"c"+3"d")] = [(4, -3),(11, 24)]`, then value of a + b – c + 2d is:

[3] Matrices
Chapter: [3] Matrices
Concept: undefined >> undefined

Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?

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

The least value of the function f(x) = 2 cos x + x in the closed interval `[0, π/2]` is:

[6] Applications of Derivatives
Chapter: [6] Applications of Derivatives
Concept: undefined >> undefined
< prev  4441 to 4460 of 8859  next > 
Advertisements
Advertisements
CBSE Science (English Medium) कक्षा १२ Question Bank Solutions
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Biology
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Chemistry
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Computer Science (C++)
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Computer Science (Python)
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ English Core
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ English Elective - NCERT
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Entrepreneurship
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Geography
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Hindi (Core)
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Hindi (Elective)
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ History
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Informatics Practices
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Mathematics
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Physical Education
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Physics
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Political Science
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Psychology
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Sanskrit (Core)
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Sanskrit (Elective)
Question Bank Solutions for CBSE Science (English Medium) कक्षा १२ Sociology
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×