हिंदी

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

Advertisements
विषयों
अध्याय
विषयों
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics
< prev  1501 to 1520 of 4674  next > 

If the feasible region for a linear programming problem is bounded, then the objective function Z = ax + by has both a maximum and a minimum value on R.

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

The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region

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

Advertisements

Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.

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

Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0

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

Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.

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

Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0

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

Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure

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

Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.

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

The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y

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

Refer to Exercise 7 above. Find the maximum value of Z.

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

The feasible region for a LPP is shown in figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.

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

In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.

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

A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem

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

Refer to quastion 12. What will be the minimum cost?

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

Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer

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

Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.

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

Refer to question 15. Determine the maximum distance that the man can travel.

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

Refer to question 15. Determine the maximum distance that the man can travel.

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

Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.

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

A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined
< prev  1501 to 1520 of 4674  next > 
Advertisements
Advertisements
CBSE Commerce (English Medium) कक्षा १२ Question Bank Solutions
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Accountancy
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Business Studies
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Computer Science (Python)
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Economics
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ English Core
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ English Elective - NCERT
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Entrepreneurship
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Geography
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Hindi (Core)
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Hindi (Elective)
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ History
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Informatics Practices
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Mathematics
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Physical Education
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Political Science
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Psychology
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Sanskrit (Core)
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Sanskrit (Elective)
Question Bank Solutions for CBSE Commerce (English Medium) कक्षा १२ Sociology
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×