English

HSC Commerce (English Medium) 12th Standard Board Exam - Maharashtra State Board Question Bank Solutions

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics

Please select a subject first

Advertisements
Advertisements
< prev  5981 to 6000 of 9014  next > 

The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.

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

State whether the following is True or False :

The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.

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

Advertisements

Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.

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

Solve the following problem :

Maximize Z = 5x1 + 6x2 Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, x2 ≥ 0

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

Solve the following problem :

Minimize Z = 4x + 2y Subject to 3x + y ≥ 27, x + y ≥ 21, x ≥ 0, y ≥ 0

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

Solve the following problem :

Minimize Z = 2x + 3y Subject to x – y ≤ 1, x + y ≥ 3, x ≥ 0, y ≥ 0

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

Solve the following problem:

Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0

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

Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0

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

A carpenter makes chairs and tables, profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines, Assembling, Finishing and Polishing. The time required for each product in hours and the availability of each machine is given by the following table.

Product/Machines Chair
(x)
Table
(y)
Available time (hours)
Assembling 3 3 36
Finishing 5 2 50
Polishing 2 6 60

Formulate and solve the following Linear programming problems using graphical method.

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

Solve the following problem :

A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B. If profits are ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.

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

Solve the following problem :

A factory produced two types of chemicals A and B The following table gives the units of ingredients P & Q (per kg) of Chemicals A and B as well as minimum requirements of P and Q and also cost per kg. of chemicals A and B.

Ingredients per kg. /Chemical Units A
(x)
B
(y)
Minimum requirements in
P 1 2 80
Q 3 1 75
Cost (in ₹) 4 6  

Find the number of units of chemicals A and B should be produced so as to minimize the cost.

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

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

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
< prev  5981 to 6000 of 9014  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×