



Assignment: MTH601 (Fall 2019)
Maximum Marks: 15 Due Date: 18 112019
DON’T MISS THESE: Important instructions before attempting the solution of this assignment:
• To solve this assignment, you should have good command over 01  09 lectures.
• Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in the 01 to 09 lectures.
• Upload assignments properly through LMS, No Assignment will be accepted through email.
• Write your ID on the top of your solution file.
• Don’t use colourful backgrounds in your solution files.
• Use Math Type or Equation Editor etc. for mathematical symbols.
• You should remember that if we found the solution files of some students are same then we will reward zero marks to all those students.
• Try to make a solution by yourself and protect your work from other students, otherwise, you and the student who send the same solution file will be given zero marks.
• Also, remember that you are supposed to submit your assignment in MS Word file format any other like scan images etc. will not be accepted and we will give zero marks corresponding to these assignments.Question:
fc609cc7c9d142ae813061119c262e34image.png
Construct a table which shows the relationship between the activities and their predecessors.Calculate the following time estimates for each activity.
Earliest Start Time (EST)
Earliest Finish Time (EFT)
Latest Start Time (LST)
Latest Finish Time (LFT)
Calculate the total float for each activity.
Identify the critical path.
Find the project completion time.
Note: The duration of each given activity is in days.



MTH601 Mid Term Paper Solved
mth601 midternsolvedmcq.docMTH601 Spring_2009_MidTerm_OPKST_OperationsResearch_MTH601.doc
MTH601 Final Term Paper Solved
MTH601 Orignal Solved Final Term Papers Made By Waqar Siddhu 1.pdf


SOLVED MTH601 Quiz 3 Solution and Discussion

Please share your current Quiz to help the Students…

The objective of a transportation problem is to develop an  transportation schedule that meets all demand from given stock at a  total shipping cost. MTH601
(integral, maximum) 
The North – West Corner Rule MTH601
Is based on the concept of minimizing opportunity cost.

The assignment problem is unbalanced if the cost matrix is not a matrix. MTH601
square
rectangle
not square 
If a balanced Transportation problem with ‘7’ sources and ‘6’sinks then its nondegenerate basic feasible solution will have independent allocations. MTH601
10 
For North West Corner method, in the first row and first column, resource and sink contain ‘5’ and ‘7’ units respectively; then after allocating the appropriate amount ‘x11’ in the cell (1,1), we will move towards which of the following cell? MTH601
(2,2) 
For the project of a firm, if ‘5’ sales persons are assigned ‘5’ different sales territories, then in how many ways a single territory can be assigned to a single sale person? MTH601
120

zareen
zareen Cyberian’s Gold 11 minutes agoThe objective of a transportation problem is to develop an  transportation schedule that meets all demand from given stock at a  total shipping cost. MTH601
(integral, maximum) 
The North – West Corner Rule MTH601
Is based on the concept of minimizing opportunity cost.

The assignment problem is unbalanced if the cost matrix is not a matrix. MTH601
square
rectangle
not square 
If a balanced Transportation problem with ‘7’ sources and ‘6’sinks then its nondegenerate basic feasible solution will have independent allocations. MTH601

If a balanced Transportation problem with ‘m’ sources and ‘n’ sinks then degeneracy will arise only if there are less than  independent allocations in the solution. MTH601
m+n–1 
For an unbalanced Transportation problem, if the total demand is LESS than total supply then which of the following is true in order to balance the problem? MTH601
A dummy sink would have to include with demand equal to the surplus

In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following? MTH601
Difference between the largest unit cost to the next largest cost in the same row(column) 
In the assignment problem, the cost matrix is . MTH601
rectangular 