→ Assignment model is a special application of Linear Programming Problem (LPP), in which the main objective is to assign the work or task to a group of individuals such that;
i) There is only one assignment.
ii) All the assignments should be done in such a way that the overall cost is minimized (or profit is maximized, incase of maximization).
→ In assignment problem, the cost of performing each task by each individual is known.
→ It is desired to find out the best assignments, such that overall cost of assigning the work is minimized.
Suppose there are 'n' tasks, which are required to be performed using 'n' resources.
The cost of performing each task by each resource is also known (shown in cells of matrix)
→ Assignment Model is a special application of Linear Programming (LP).
→ The mathematical formulation for Assignment Model is given below:
→ Let, denotes the cost of resources 'i' to the task 'j'; such that
→ Now assignment problems are of the Minimization type. So, our objective function is to minimize the overall cost.
→ Subjected to constraint;
(i) For all task, only one resource is possible:
(ii) For all resource, there is only one task possible;
(iii) is '0' or '1'.
In assignment problem, either allocation is done to the cell or not.
So this can be formulated using 0 or 1 integer.
While using this method, we will have n x n decision varables, and n+n equalities.
So even for 4 x 4 matrix problem, it will have 16 decision variables and 8 equalities.
So this method becomes very lengthy and difficult to solve.
As assignment problem is a special case of transportation problem, it can also be solved using transportation methods.
In transportation methods (NWCM, LCM & VAM), the total number of allocations will be (m+n-1) and the solution is known as non-degenerated. (For eg: for 3 x 3 matrix, there will be 3+3-1 = 5 allocations)
But, here in assignment problems, the matrix is a square matrix (m=n).
So total allocations should be (n+n-1), i.e. for 3 x 3 matrix, it should be (3+3-1) = 5
But, we know that in 3 x 3 assignment problem, maximum possible possible assignments are 3 only.
So, if are we will use transportation methoods, then the solution will be degenerated as it does not satisfy the condition of (m+n-1) allocations.
So, the method becomes lengthy and time consuming.
It is a simple trail and error type method.
Consider a 3 x 3 assignment problem. Here the assignments are done randomly and the total cost is found out.
For 3 x 3 matrix, the total possible trails are 3!
So total 3! = 3 x 2 x 1 = 6 trails are possible.
The assignments which gives minimum cost is selected as optimal solution.
But, such trail and error becomes very difficult and lengthy.
If there are more number of rows and columns,
( For eg: For 6 x 6 matrix, there will be 6! trails. So 6! = 6 x 5 x 4 x 3 x 2 x 1 = 720 trails possible)
then such methods can't be applied for solving assignments problems.
It was developed by two mathematicians of Hungary. So, it is known as Hungarian Method.
It is also know as Reduced matrix method or Flood's technique.
There are two main conditions for applying Hungarian Method:
(1) Square Matrix (n x n).
(2) Problem should be of minimization type.
|Activity||t o||t m||t p|
Solution: First of all draw the network diagram for given data as shown below:
Here the time for completion of activities are probabilistic. So, using given values of time we will find the expected time to completion the activities and variance.
For each given activity we will calculate the expected time as follows:
|Activity||t o||t m||t p||Variance (V)|
Now based on estimate time, we calculate the EST, EFT, LST and LFT for each activity to find out critical path of project as shown below. (Click here to know about calculation of EST, EFT, LST and LFT from CPM numerical)
Here the critical path is along the activities
4-6. So the critical path is
1-2-4-6. Following diagram is prepared to show critical path along with EST and LFT.
The critical path = 1-2-4-6 with time duration of 24 days.
Here standard deviation is calculated for activities of critical path. So we get
Now the probability of completion of project in that given time (t) of 26 days, can be calculate by below formula,
Using table in Appendix-B, we get probability
As you can see below in Appendix-B the first column Z that is the probability we find out in the example through formula. The second column represent the probability in percentage .
As we have value of now you can see in table we have which has and has we take average of both we get
As you can see for which is and for which is
The North West corner method is one of the methods to obtain a basic feasible solution of the transportation problems (special case of LPP).
We will now see how to apply this very simple method to a transportation problem. We will study steps of this method while applying it in the problem itself.
Note that all the explanation is provided in “CYAN” colour. You have to write in examination the only thing which are given in this regular colour under each steps(if any), else you can directly solve matrix of the problem as explained here
Balance the problem meaning we need to check that if;
If this holds true, then we will consider the given problem as a balanced problem.
Now, what if it’s not balanced?
If such a condition occurs, then we have to add a dummy source or market; whichever makes the problem balanced. You can watch a video on this type of numerical, which is known as Unbalanced Transportation Problems.
The given transportation problem is balanced.
We will start the allocation from the left hand top most corner (north-west) cell in the matrix and make allocation based on availability and demand.
Now, verify the smallest among the availability (Supply) and requirement (Demand), corresponding to this cell. The smallest value will be allocated to this cell and check out the difference in supply and demand, representing that supply and demand are fulfilled, as shown below.
As we have fulfilled the availability or requirement for that row or column respectively, remove that row or column and prepare a new matrix, as shown below.
Repeat the same procedure of allocation of the new North-west corner so generated and check based on the smallest value as shown below, until all allocations are over.
Once all allocations are over, prepare the table with all allocations marked and calculate the transportation cost as follows.
Find solution of same numerical by:
A V-engine is a two cylinder engine, which has a common crank and the axis of cylinder makes a "V" shape.
Since V-engines have a common crank and the crank revolves in one plane, there is no primary or secondary couple acting on the engine.
Consider a V-engine as shown in fig.1 having common crank OC and two connecting rods CP and CQ. The lines of stroke OP and OQ are inclined to vertical axis OY at an angle ‘α’.
We know that,
As both components and are acting in same direction;
As both components and are acting opposite to each other;
The angle made by resultant primary force with vertical axis is;
As both components and are acting in same direction;
As both components and are acting opposite to each other;
The angle made by resultant secondary force with vertical axis is;
Click here to know about Methods to solve Transportation Model Problem provided below here in notes ↓
Transportation Model is a special case of LPP(Linear Programming Problem) in which the main objective is to transport a product from various sources to various destinations at total minimum cost.
In Transportation Models, the sources and destinations are known, the supply and demand at each source and destinations are also known.
It is designed to find the best arrangement for transportation such that the transportation cost is minimum.
Consider three companies (Company1, Company2 and Company3) which produce mobile phones and are located in different regions.
Similarly, consider three cities (namely CityA, CityB & CityC) where the mobile phones are transported.
The companies where mobile phones are available are known as sources and the cities where mobile phones are transported are called destinations.
Company1 produces a1 units,
Company2 produces a2 units,
Company3 produces a3 units.
demand in CityA is b1 units,
demand in CityB is b2 units,
demand in CityC is b3 units.
The cost of transportation from each source to destination is given in table
i) Balanced transportation problem: The sum of supply and sum of demand are same.
ii) Unbalanced transportation problem: The sum of supply and sum of demand are different.
PERT is the technique used to find project completion time of “variable activities”. In PERT, the time is combination of three different time estimations. Following are the three different time estimation:
Fig.1(Critically Damped System)
ξis equal to one, or the damping coefficient
cis equal to critical damping coefficient "cc", then the system is said to be a critically damped system.
Now, let at
Substituting these values in equation (1):
From above equation (5), it is seen that as time
t increases, the displacement
x decreases exponentially.
The motion of a critically damped system is aperiodic (aperiodic motion motions are those motions in which the motion does not repeat after a regular interval of time i.e non periodic motion) and so the system does not shows vibrations.
For critically damped systems, if a system is displaced from its initial position, it will try to reach its mean position in a very short time.
Critically damped systems are generally seen in hydraulic doors closer as it is necessary for the door to come to its initial position in a very short time.
final amplitude after two complete cycle
The natural circular frequency of vibration is,
From equation (1); we get,
Damping force at unit velocity;
The time period of damped vibration is,
We know that the characteristic equation of the damped free vibration system is,
This is a quadratic equation having two roots and ;
In order to convert the whole equation in the form of , we will use two parameters, critical damping coefficient '' and damping factor ''. So the roots and can be written as follows;
where, = natural frequency of undamped free vibration = rad/s
So we can write roots and and as;
If the damping factor ‘’ is greater than one or the damping coefficient ‘’ is greater than critical damping coefficient ‘’, then the system is said to be over-damped.
In overdamped system, the roots are given by;
For , we get and as real and negative so we get,
Now differentiating equation (1) with respect to ‘t’, we get;
Now, let at
Substituting this value in equation (1) we get;
Substituting this value in equation (2) we get;
From equation (3), and putting value of B in (4);
Putting , in equation (4);
Now putting equation (5) and (6) in equation (1), we get;
Above equation represents the equation of motion for overdamped system.
The motion obtained by above equation is aperiodic (aperiodic motion motions are those motions in which the motion does not repeats after a regular interval of time i.e non periodic motion) and so the system does not shows vibrations.
This type of system does not show much damping, so this systems are used very rarely.
When machine is in working condition different forces are acting on it which may cause machine to vibrate and cause damage to machine parts. The different forces acting on machine parts are static forces and dynamic forces.
The force which depends on weight of a body, is known as static force. (Generally, a static force acts when vibrations occurs in same plane.)
The force which depends on acceleration of a body, is known as dynamic force. (Generally, dynamic force acts when vibrations occurs in different planes.)
Due to these forces, the efficiency of the system decreases and life span of the system also decreases.
Due to these forces, the machine starts vibrating and sometimes when the vibrations increases, the machine would lift from it’s position and cause damage to other machine or human. So to avoid this, foundation is made below the machine (as you can see in the Fig-1 below), which absorbs the vibration and protects the machine against causing damage. Thus, balancing of the machine is required.
Balancing is the process of eliminating, the effect of static forces and dynamic forces acting on machine components.
In any system with one or more rotating masses, if the centre of mass of the system does not lie on the axis of rotation, then the system is said to be unbalanced.
As you can see in the Fig-2 we have a rotor which is mounted on a shaft and the shaft has its own axis of rotation. Now you can see that the C.G(centre of gravity) of the rotor is at a distance r from the axis of rotation of the shaft, so when the rotor will start to rotate, a centrifugal force will act on it which is in the outward direction as you can see in Fig-3. Due to this force our system will become unbalanced and it will start to vibrate.
A system is said to be statically balanced, if the centre of masses(C.G) of the system lies on the axis of rotation.
The resultant of all the centrifugal forces (dynamic forces) acting on the system during rotation must be zero.
A system is said to be dynamically balanced, if it satisfies following two conditions:-
Logarithmic decrement is defined as the natural logarithm of the ratio of successive amplitude on the same side of mean position.
The rate of decay in the amplitudes of under-damped system is measured by the parameter known as logarithmic decrement.
Rate of decay in amplitudes depends on the amount of damping present in the system. So if the damping is more, then the rate of decay will also be more.
Let A and B are the two points on the successive cycles which shows maximum deflection as shown in figure.
The periodic time:
The amplitude at time and are:
Taking ratio, we get;
The logarithmic decrement is given by;
The logarithmic decrement can also be determined as follows;
= amplitude at the starting position
= amplitude after ‘n’ cycles
If the damping factor is less than one or the damping coefficient is less than critical damping coefficient , then the system is said to be an under-damped system.
Where is the imaginary unit of complex root