हिंदी

HSC Commerce (English Medium) १२ वीं कक्षा - Maharashtra State Board Question Bank Solutions

Advertisements
विषयों
अध्याय
विषयों
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  5101 to 5120 of 8661  next > 

A job production unit has four jobs A, B, C, D which can be manufactured on each of the four machines P, Q, R and S. The processing cost of each job for each machine is given in the following table:

Jobs Machines
(Processing Cost in ₹)
P Q R S
A 31 25 33 29
B 25 24 23 21
C 19 21 23 24
D 38 36 34 40

Find the optimal assignment to minimize the total processing cost.

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

Five wagons are available at stations 1, 2, 3, 4, and 5. These are required at 5 stations I, II, III, IV, and V. The mileage between various stations are given in the table below. How should the wagons be transported so as to minimize the mileage covered?

  I II III IV V
1 10 5 9 18 11
2 13 9 6 12 14
3 3 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10
[15] Assignment Problem and Sequencing
Chapter: [15] Assignment Problem and Sequencing
Concept: undefined >> undefined

Advertisements

Five different machines can do any of the five required jobs, with different profits resulting from each assignment as shown below:

Job Machines (Profit in ₹)
A B C D E
1 30 37 40 28 40
2 40 24 27 21 36
3 40 32 33 30 35
4 25 38 40 36 36
5 29 62 41 34 39

Find the optimal assignment schedule.

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

The assignment problem is said to be unbalance if ______

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

The assignment problem is said to be balanced if ______.

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

Choose the correct alternative :

The assignment problem is said to be balanced if it is a ______.

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

Choose the correct alternative :

In an assignment problem if number of rows is greater than number of columns then

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

The objective of an assignment problem is to assign ______. 

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

Fill in the blank :

When an assignment problem has more than one solution, then it is _______ optimal solution.

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

Fill in the blank :

An _______ is a special type of linear programming problem.

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

In an assignment problem, if number of column is greater than number of rows, then a dummy column is added.

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

State whether the following is True or False :

In assignment problem, each facility is capable of performing each task.

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

State whether the following is True or False :

It is not necessary to express an assignment problem into n x n matrix.

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

Solve the following problem :

A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This estimate of the time each man would take to perform each task is given in the effectiveness matrix below.

  I II III IV
A 7 25 26 10
B 12 27 3 25
C 37 18 17 14
D 18 25 23 9

How should the tasks be allocated, one to a man, as to minimize the total man hours?

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

Solve the following problem :

A dairy plant has five milk tankers, I, II, III, IV and V. These milk tankers are to be used on five delivery routes A, B, C, D and E. The distances (in kms) between the dairy plant and the delivery routes are given in the following distance matrix.

  I II III IV V
A 150 120 175 180 200
B 125 110 120 150 165
C 130 100 145 160 175
D 40 40 70 70 100
E 45 25 60 70 95

How should the milk tankers be assigned to the chilling center so as to minimize the distance travelled?

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

If X has Poisson distribution with m = 1, then find P(X ≤ 1) given e−1 = 0.3678

[16] Probability Distributions
Chapter: [16] Probability Distributions
Concept: undefined >> undefined

If X~P(0.5), then find P(X = 3) given e−0.5 = 0.6065.

[16] Probability Distributions
Chapter: [16] Probability Distributions
Concept: undefined >> undefined

If X has Poisson distribution with parameter m and P(X = 2) = P(X = 3), then find P(X ≥ 2). Use e−3 = 0.0497

[16] Probability Distributions
Chapter: [16] Probability Distributions
Concept: undefined >> undefined

The number of complaints which a bank manager receives per day follows a Poisson distribution with parameter m = 4. Find the probability that the manager receives only two complaints on a given day

[16] Probability Distributions
Chapter: [16] Probability Distributions
Concept: undefined >> undefined

The number of complaints which a bank manager receives per day follows a Poisson distribution with parameter m = 4. Find the probability that the manager receives a) only two complaints on a given day, b) at most two complaints on a given day. Use e−4 = 0.0183.

[16] Probability Distributions
Chapter: [16] Probability Distributions
Concept: undefined >> undefined
< prev  5101 to 5120 of 8661  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×