मराठी

Arts (English Medium) इयत्ता १२ - CBSE Important Questions for Mathematics

Advertisements
[object Object]
[object Object]
विषय
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics
< prev  921 to 927 of 927  next > 

Solve the following linear programming problem graphically:

Minimize: Z = 5x + 10y

Subject to constraints:

x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following linear programming problem graphically:

Maximize: Z = x + 2y

Subject to constraints:

x + 2y ≥ 100,

2x – y ≤ 0

2x + y ≤ 200,

x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following Linear Programming problem graphically:

Maximize: Z = 3x + 3.5y

Subject to constraints:

x + 2y ≥ 240,

3x + 1.5y ≥ 270,

1.5x + 2y ≤ 310,

x ≥ 0, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following Linear Programming Problem graphically:

Minimize: Z = 60x + 80y

Subject to constraints:

3x + 4y ≥ 8

5x + 2y ≥ 11

x, y ≥ 0

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.


Which of the following is not a constraint to the given Linear Programming Problem?

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following Linear Programming Problem graphically:

Minimize: z = x + 2y,

Subject to the constraints: x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200, x, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems

Solve the following Linear Programming Problem graphically:

Maximize: z = – x + 2y,

Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.

Appears in 1 question paper
Chapter: [12] Linear Programming
Concept: Graphical Method of Solving Linear Programming Problems
< prev  921 to 927 of 927  next > 
Advertisements
Advertisements
CBSE Arts (English Medium) इयत्ता १२ Important Questions
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Accountancy
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Business Studies
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Computer Science (Python)
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Economics
Important Questions for CBSE Arts (English Medium) इयत्ता १२ English Core
Important Questions for CBSE Arts (English Medium) इयत्ता १२ English Elective - NCERT
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Entrepreneurship
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Geography
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Hindi (Core)
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Hindi (Elective)
Important Questions for CBSE Arts (English Medium) इयत्ता १२ History
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Informatics Practices
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Mathematics
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Physical Education
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Political Science
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Psychology
Important Questions for CBSE Arts (English Medium) इयत्ता १२ Sociology
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×