हिंदी

HSC Commerce: Marketing and Salesmanship १२ वीं कक्षा - Maharashtra State Board Important Questions for Mathematics and Statistics

Advertisements
[object Object]
[object Object]
विषयों
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics and Statistics
< prev  441 to 460 of 472  next > 

An unbalanced assignment problems can be balanced by adding dummy rows or columns with ______ cost

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

In sequencing problem the time which required to complete all the jobs i.e. entire task is called ______

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Sequencing Problem
Book A B C D
Printing 5 8 10 7
Data Entry 7 4 3 6

The optimum sequence for the above data is ______

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Finding an Optimal Sequence

State whether the following statement is True or False:

In sequencing problem the processing times are dependent of order of processing the jobs on machine

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Sequencing Problem

Find the assignments of salesman to various district which will yield maximum profit

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
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

Find the sequence that minimizes total elapsed time to complete the following jobs in the order XY. Find the total elasped time and idle times for each machine.

Jobs A B C D E
Machine X 10 2 18 6 20
Machine Y 4 12 14 16 8
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Types of Sequencing Problem

For the following assignment problem minimize total man hours:

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

Subtract the `square` element of each `square` from every element of that `square`

Subordinates Required hours for task
I II III IV
A 0 18 19 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0

Subtract the smallest element in each column from `square` of that column.

Subordinates Required hours for task
I II III IV
A `square` `square` 19 `square`
B `square` `square` 0 `square`
C `square` `square` 3 `square`
D `square` `square` 14 `square`

The lines covering all zeros is `square` to the order of matrix `square`

The assignment is made as follows:

Subordinates Required hours for task
I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Optimum solution is shown as follows:

A → `square, square` → III, C → `square, square` → IV

Minimum hours required is `square` hours

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

State whether the following statement is true or false:

To convert a maximization-type assignment problem into a minimization problem, the smallest element in the matrix is deducted from all elements of the matrix.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

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

Job Machines
(Processing cost in ₹)
I II III IV
P 31 25 33 29
Q 25 24 23 21
R 19 21 23 24
S 38 36 34 40

Find the optimal assignment to minimize the total processing cost.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Five jobs are performed first on machine M1 and then on machine M2. Time taken in hours by each job on each machine is given below:

Machines↓\Jobs→ 1 2 3 4 5
M1 6 8 4 5 7
M2 3 7 6 4 16

Determine the optimal sequence of jobs and total elapsed time. Also, find the idle time for two machines.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Finding an Optimal Sequence

A department store has four workers to pack goods. The times (in minutes) required for each worker to complete the packings per item sold is given below. How should the manager of the store assign the jobs to the workers, so as to minimize the total time of packing?

Workers Packing of
  Books Toys Crockery Cutlery
A 3 11 10 8
B 13 2 12 12
C 3 4 6 1
D 4 15 4 9
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

A marketing manager has list of salesmen and territories. Considering the travelling cost of the salesmen and the nature of territory, the marketing manager estimates the total of cost per month (in thousand rupees) for each salesman in each territory. Suppose these amounts are as follows:

Salesman Territories
  I II III IV V
A 11 16 18 15 15
B 7 19 11 13 17
C 9 6 14 14 7
D 13 12 17 11 13

Find the assignment of salesman to territories that will result in minimum cost.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

Six jobs are performed on Machines M1 and M2 respectively. Time in hours taken by each job on each machine is given below:

Jobs `→` A B C D E F
Machines `↓`
M1 3 12 5 2 9 11
M2 8 10 9 6 3 1

Determine the optimal sequence of jobs and find total elapsed time. Also find the idle time for machines M1 and M2.

Solution:

Given jobs can be arranged in optimal sequence as,

D A C B E F

 

Jobs Machine M1 Machine M2
  In Out In Out
D 0 2 `square` 8
A 2 5 8 16
C 5 10 16 25
B 10 22 25 35
E 22 31 35 38
F 31 42 `square` 43

Total Elapsed time = `square` hrs.

Idle time for Machine M1 = 43 – 42 = 1 hour.

Idle time for Machine M2 = `square` hrs.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Finding an Optimal Sequence

Three new machines M1, M2, M3 are to be installed in a machine shop. There are four vacant places A, B, C, D. Due to limited space, machine M2 can not be placed at B. The cost matrix (in hundred rupees) is as follows:

Machines Places
  A B C D
M1 13 10 12 11
M2 15 - 13 20
M3 5 7 10 6

Determine the optimum assignment schedule and find the minimum cost.

Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Special Cases of Assignment Problem

The number of complaints which a bank manager receives per day is a Poisson random variable with parameter m = 4. Find the probability that the manager will receive -

(a) only two complaints on any given day.

(b) at most two complaints on any given day

[Use e-4 =0.0183]

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

 If a random variable X follows Poisson distribution such that P(X = l) =P(X = 2), then find P(X ≥ 1).  [Use e-2 = 0.1353] 

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

 If X has Poisson distribution with parameter m = 1, find P[X ≤ 1]  [Use `e^-1 = 0.367879`]

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

If X has a Poisson distribution with variance 2, find P (X = 4) 

[Use e-2 = 0.1353] 

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

If X has a Poisson distribution with variance 2, find P(X ≤ 4) 

[Use e-2 = 0.1353] 

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution

If X has a Poisson distribution with variance 2, find 

Mean of X [Use e-2 = 0.1353] 

Appears in 1 question paper
Chapter: [16] Probability Distributions
Concept: Poisson Distribution
< prev  441 to 460 of 472  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×