HSC Commerce: Marketing and Salesmanship इयत्ता १२ वी - Maharashtra State Board Important Questions

Solution which satisfy all constraints is called ______ solution.

Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.

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:

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

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

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

Solve the following minimal assignment problem : 

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

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

Solve the following maximal 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 ?

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.

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?

In the modification of a plant layout of a factory four new machines M₁, M₂, M₃ and M₄ 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 M₂ cannot be placed at C and M₃ cannot be placed at A. The cost of locating a machine at a place (in hundred rupees) is as follows.

Find the optimal assignment schedule.

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.

Find the optimal sequence that minimizes total time required to complete the following jobs in the order ABC. The processing times are given in hours.

If jobs A to D have processing times as 5, 6, 8, 4 on first machine and 4, 7, 9, 10 on second machine then the optimal sequence is ______.

If there are n jobs and m machines, then there will be_______ sequences of doing the jobs.

To use the Hungarian method, a profit maximization assignment problem requires ______.

Choose the correct alternative :

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

The objective of an assignment problem is to assign ______.