Topics
Mathematical Logic
Matrices
Differentiation
- Derivative of Composite Functions
- Derivative of Inverse Function
- Derivatives of Logarithmic Functions
- Derivatives of Implicit Functions
- Derivatives of Parametric Functions
- Second Order Derivative
- Overview of Differentiation
Applications of Derivatives
Integration
Definite Integration
Applications of Definite Integration
- Standard Forms of Parabola and Their Shapes
- Ellipse and its Types
- Area Under Simple Curves
- Overview of Application of Definite Integration
Differential Equation and Applications
- Differential Equations
- Order and Degree of a Differential Equation
- Formation of Differential Equation by Eliminating Arbitary Constant
- Equations in Variable Separable Form
- Homogeneous Differential Equations
- Linear Differential Equations
- Applications of Differential Equation
- Overview of Differential Equations
Commission, Brokerage and Discount
- Commission and Brokerage Agent
- Concept of Discount
- Overview of Commission, Brokerage and Discount
Insurance and Annuity
- Insurance
- Types of Insurance
- Annuity
- Overview of Insurance and Annuity
Linear Regression
- Regression
- Types of Linear Regression
- Fitting Simple Linear Regression
- The Method of Least Squares
- Lines of Regression of X on Y and Y on X Or Equation of Line of Regression
- Properties of Regression Coefficients
- Overview: Linear Regression
Time Series
- Introduction to Time Series
- Uses of Time Series Analysis
- Components of a Time Series
- Mathematical Models
- Measurement of Secular Trend
- Overview of Time Series
Index Numbers
- Weighted Aggregate Method
- Cost of Living Index Number
- Method of Constructing Cost of Living Index Numbers - Aggregative Expenditure Method
- Overview of Index Numbers
- Method of Constructing Cost of Living Index Numbers - Family Budget Method
- Uses of Cost of Living Index Number
Linear Programming
Assignment Problem and Sequencing
- Assignment Problem
- Hungarian Method of Solving Assignment Problem
- Special Cases of Assignment Problem
- Sequencing Problem
- Types of Sequencing Problem
- Finding an Optimal Sequence
- Overview of Assignment Problem and Sequencing
Probability Distributions
- Definition and formulation
- Solution of assignment problems (Hungarian Method)
Shaalaa.com | Assignment Problem
Related QuestionsVIEW ALL [42]
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 |
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 |
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.
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 |
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 |
