English

HSC Commerce: Marketing and Salesmanship 12th Standard Board Exam - Maharashtra State Board Important Questions

Advertisements
Subjects
Topics
Subjects
Popular subjects
Topics

Please select a subject first

Advertisements
Advertisements
< prev  1901 to 1920 of 2512  next > 

`sqrt((sump_1q_0)/(sump_0q_0)) xx sqrt((sump_1q_1)/(sump_0q_1)) xx 100`

Appears in 1 question paper
Chapter: [13] Index Numbers
Concept: Construction of Index Numbers >> Weighted Aggregate Method

Laspeyre’s Price Index Number uses current year’s quantities as weights.

Appears in 1 question paper
Chapter: [13] Index Numbers
Concept: Construction of Index Numbers >> Weighted Aggregate Method

Calculate Marshall – Edgeworth’s price index number for the following data:

Commodity Base year Current year
Price Quantity Price Quantity
P 12 20 18 24
Q 14 12 21 16
R 8 10 12 18
S 16 15 20 25
Appears in 1 question paper
Chapter: [13] Index Numbers
Concept: Construction of Index Numbers >> Weighted Aggregate Method

The cost of living index number using Weighted Relative Method is given by ______.

Appears in 1 question paper
Chapter: [13] Index Numbers
Concept: Cost of Living Index Number

Feasible region is the set of points which satisfy ______.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Basic Concepts of Linear Programming

A doctor prescribed 2 types of vitamin tablets, T1 and T2 for Mr. Dhawan. The tablet T1 contains 400 units of vitamin and T2 contains 250 units of vitamin. If his requirement of vitamin is at least 4000 units, then the inequation for his requirement will be ______

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Basic Concepts of Linear Programming

Heramb requires at most 400 calories from his breakfast. Every morning he likes to take oats and milk. If each bowl of oats and a glass of milk provides him 80 calories and 50 calories respectively, then as a constraint this information can be expressed as ______

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Basic Concepts of Linear Programming

Conditions under which the object function is to be maximum or minimum are called ______.

Appears in 1 question paper
Chapter: [14] Linear Programming
Concept: Basic Concepts of Linear Programming

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 is given in the following table:

         Jobs

 

 

                          Machines

P

Q

R

S

                Processing Cost (Rs.)

 

A

31

25

33

29

B

25

24

23

21

C

19

21

23

24

D

38

36

34

40

 How should the jobs be assigned to the four machines so that the total processing cost is minimum?

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

Solve the following minimal assignment problem and hence find the minimum value : 

  I II III IV
A 2 10 9 7
B 13 2 12 2
C 3 4 6 1
D 4 15 4 9

 

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

Suggest optimum solution to the following assignment. Problem, also find the total minimum service time.
                                             Service Time ( in hrs.)

Counters Salesmen
A B C D
W 41 72 39 52
X 22 29 49 65
Y 27 39 60 51
Z 45 50 48 52
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Solve the following minimal assignment problem : 

Machines A B C D E
M1 27 18 20 21
M2 31 24 21 12 17
M3 20 17 20 16
M4 21 28 20 16 27
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Determine `l_92 and l_93, "given that"  l_91 = 97, d_91 = 38 and q_92 = 27/59`

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

Solve the following minimal assignment problem and hence find minimum time where  '- ' indicates that job cannot be assigned to the machine : 

Machines Processing time in hours
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
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

Solve the following maximal assignment problem :

Branch Manager Monthly Business ( Rs. lakh)
A B C D
P 11 11 9 9
Q 13 16 11 10
R 12 17 13 8
S 16 14 16 12

 

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

A departmental head has three jobs and four subordinates. The subordinates differ in their capabilities and the jobs differ in their work
contents. With the help of the performance matrix given below, find out which of the four subordinates should be assigned which jobs ?

Subordinates Jobs
I II III
A 7 3 5
B 2 7 4
C 6 5 3
D 3 4 7
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

In a factory there are six jobs to be performed each of which should go through two machines A and B in the order A - B. The processing timing (in hours) for the jobs arc given here. You are required to determine the sequence for performing the jobs that would minimize the total elapsed time T. What is the value of T? Also find the idle time for machines · A and B.

Jobs J1 J2 J3 J4 J5 J6
Machine A 1 3 8 5 6 3
MAchine B 5 6 3 2 2 10
Appears in 1 question paper
Chapter: [15] Assignment Problem and Sequencing
Concept: Assignment Problem

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

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.

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

There are five jobs, each of which must go through two machines in the order XY. Processing times (in hours) are given below. Determine the sequence for the jobs that will minimize the total elapsed time. Also find the total elapsed time and idle time for each machine.

Job 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
< prev  1901 to 1920 of 2512  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×