मराठी

HSC Commerce (English Medium) इयत्ता १२ वी - Maharashtra State Board Question Bank Solutions for Mathematics and Statistics

Advertisements
[object Object]
[object Object]
विषय
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics and Statistics
< prev  1261 to 1280 of 2353  next > 

Solve the following problem :

A Company produces mixers and processors Profit on selling one mixer and one food processor is ₹ 2000 and ₹ 3000 respectively. Both the products are processed through three machines A, B, C The time required in hours by each product and total time available in hours per week on each machine are as follows:

Machine/Product Mixer per unit Food processor per unit Available time
A 3 3 36
B 5 2 50
C 2 6 60

How many mixers and food processors should be produced to maximize the profit?

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

Solve the following problem :

A person makes two types of gift items A and B requiring the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher's time. B requires 2 hours of cutters time, 4 hours of finishers time. The cutter and finisher have 208 hours and 152 hours available times respectively every month. The profit of one gift item of type A is ₹ 75 and on gift item B is ₹ 125. Assuming that the person can sell all the items produced, determine how many gift items of each type should be make every month to obtain the best returns?

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

Advertisements

Solve the following problem :

A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components, a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufacture per month to maximize profit? How much is the maximum profit?

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

Calculate the cost of living index in problem 

Group Base Year Current Year
  Price Quantity Price
Food 120 15 170
Clothing 150 20 190
Fuel & Lighting 130 30 220
House Rent 160 10 180
Miscellaneous 200 12 200
[13] Index Numbers
Chapter: [13] Index Numbers
Concept: undefined >> undefined

Calculate the cost of living index in problem

Group Base Year Current Year
  Price Quantity Price
Food 40 15 45
Clothing 30 10 35
Fuel & Lighting 20 17 25
House Rent 60 22 70
Miscellaneous 70 25 80
[13] Index Numbers
Chapter: [13] Index Numbers
Concept: undefined >> undefined

Calculate the cost of living index in problem

Group Base Year Current Year
  Price Quantity Price
Food 132 10 170
Clothing 154 12 160
Fuel & Lighting 164 20 180
House Rent 175 18 195
Miscellaneous 128 5 120
[13] Index Numbers
Chapter: [13] Index Numbers
Concept: undefined >> undefined

The cost of Living Index Number using Aggregate Expenditure Method is given by ______.

[13] Index Numbers
Chapter: [13] Index Numbers
Concept: undefined >> undefined

Four new machines M1, M2, M3 and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed at C and M3 cannot be placed at A. The cost matrix is given below:

Machines Places
A B C D E
M1 4 6 10 5 6
M2 7 4 5 4
M3 6 9 6 2
M4 9 3 7 2 3

Find the optimal assignment schedule.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

A company has a team of four salesmen and there are four districts where the company wants to start its business. After taking into account the capabilities of salesmen and the nature of districts, the company estimates that the profit per day in rupees for each salesman in each district is as below:

Salesman District
  1 2 3 4
A 16 10 12 11
B 12 13 15 15
C 15 15 11 14
D 13 14 14 15

Find the assignment of salesman to various districts which will yield maximum profit.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

In the modification of a plant layout of a factory four new machines M1, M2, M3 and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed at C and M3 cannot be placed at A. The cost of locating a machine at a place (in hundred rupees) is as follows.

Machines Location
A B C D E
M1 9 11 15 10 11
M2 12 9 10 9
M3 11 14 11 7
M4 14 8 12 7 8

Find the optimal assignment schedule.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

An assignment problem is said to be unbalanced when _______.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

When the number of rows is equal to the number of columns then the problem is said to be _______ assignment problem.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

If the given matrix is not a _______ matrix, the assignment problem is called an unbalanced problem.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

A dummy row(s) or column(s) with the cost elements as _______ is added to the matrix of an unbalanced assignment problem to convert into a square matrix.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Maximization assignment problem is transformed to minimization problem by subtracting each entry in the table from the _______ value in the table.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

In an assignment problem, a solution having _______ total cost is an optimum solution.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Fill in the blank :

In maximization type, all the elements in the matrix are subtracted from the _______ element in the matrix.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

To convert the assignment problem into a maximization problem, the smallest element in the matrix is deducted from all other elements.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

State whether the following is True or False :

The purpose of dummy row or column in an assignment problem is to obtain balance between total number of activities and total number of resources.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

State whether the following is True or False

In number of lines (horizontal on vertical) > order of matrix then we get optimal solution.

[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined
< prev  1261 to 1280 of 2353  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×