हिंदी

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

Advertisements
विषयों
अध्याय
विषयों
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics
< prev  2781 to 2800 of 7914  next > 

The straight line \[\frac{x - 3}{3} = \frac{y - 2}{1} = \frac{z - 1}{0}\] is

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

The shortest distance between the lines  \[\frac{x - 3}{3} = \frac{y - 8}{- 1} = \frac{z - 3}{1} \text{ and }, \frac{x + 3}{- 3} = \frac{y + 7}{2} = \frac{z - 6}{4}\] 

 

 

 

 

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

Advertisements

Maximize Z = 5x + 3y
Subject to

\[3x + 5y \leq 15\]
\[5x + 2y \leq 10\]
\[ x, y \geq 0\]

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

Maximize Z = 9x + 3y
Subject to 

2x + 3y ≤ 13

3x + y ≤ 5

x, y ≥ 0

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

Minimize Z = 18x + 10y
Subject to 

\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]

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

Maximize Z = 50x + 30y
Subject to 

\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]

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

Maximize Z = 4x + 3y
subject to

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]

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

Maximize Z = 15x + 10y
Subject to 

\[3x + 2y \leq 80\]
\[2x + 3y \leq 70\]
\[ x, y \geq 0\]

 

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

Maximize Z = 10x + 6y
Subject to

\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ x, y \geq 0\]

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

Maximize Z = 3x + 4y
Subject to

\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]

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

Maximize Z = 7x + 10y
Subject to 

\[x + y \leq 30000\]
\[ y \leq 12000\]
\[ x \geq 6000\]
\[ x \geq y\]
\[ x, y \geq 0\]

 

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

Minimize Z = 2x + 4y
Subject to 

\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]

 

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

Minimize Z = 5x + 3y
Subject to 

\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ x, y \geq 0\]

 

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

Minimize Z = 30x + 20y
Subject to 

\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]

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

Maximize Z = 4x + 3y
Subject to 

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]

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

Minimize Z = x − 5y + 20
Subject to

\[x - y \geq 0\]
\[ - x + 2y \geq 2\]
\[ x \geq 3\]
\[ y \leq 4\]
\[ x, y \geq 0\]

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

Maximize Z = 3x + 5y
Subject to

\[x + 2y \leq 20\]
\[x + y \leq 15\]
\[ y \leq 5\]
\[ x, y \geq 0\]

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

Minimize Z = 3x1 + 5x2
Subject to

\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \geq 0\]

 

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

Maximize Z = 2x + 3y
Subject to

\[x + y \geq 1\]
\[10x + y \geq 5\]
\[x + 10y \geq 1\]
\[ x, y \geq 0\]

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

Maximize Z = −x1 + 2x2
Subject to

\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \geq 0\]

 

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined
< prev  2781 to 2800 of 7914  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×