MTH601 - Operations Research

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 insensitivity of the solution relative to the original decision variables in an LP problem which is solved by M-method is overcome by ----------. MTH601 Simplex method In Big M-method, if the objective function is expressed in terms of non-basic variable then the coefficient of artificial variable in this iteration must be -------. MTH601 M In two phase method, for the phase-I, if the objective function in terms of artificial variables is not minimized then the given problem has----------. MTH601 Feasible solution In the initial iteration of Big M-method, the artificial variables appear in ---------. MTH601 Basis In two phase method, which of the following will be taken as starting solution for 2nd phase? MTH601 Basic solution of 1st phase containing non-zero artificial variables In the Simplex method to solve an LP problem of minimization, if at the end of iteration, there is a positive coefficient in the objective row then the given problem -------------. MTH601 can not be optimized In the Simplex method to solve an LP problem of maximization, if at the end of an iteration, there is a negative coefficient in the objective row then the given problem---------. MTH601 needs further improvement In an LP problem, to evaluate the basic variables in Simplex method in any iteration, we would have to express Objective function in terms of ------------- variables. MTH601 Artificial Which of the following is true about the inclusion of non-negative slack variable into a constraint of type ‘less than or equal’? MTH601 This inclusion doest not affect the inequality Under which of the following condition to solve an LP by using two phase method, we can’t proceed for 2nd phase? MTH601 Objective function of 1st phase has zero value.

@zaasmi 3. Calculate the total float for each activity. Correct Solution Answer: [image: M9X6s5P.png] Identify the critical path. Answer: A+C+E+G = 3+2+5+6 = 16 A+D1+F+G = 3+0+3+6 = 12 B+D+F+G = 5+4+3+6 = 18 A+C+D2+F+G = 3+2+0+3+6 = 14 The longest path is and the duration is 18 days. So, the critical path is . Find the project completion time. Answer: The project completion time is 18 days.

@Zain-Sports please ready discussion and get solution not only for get it easy!

https://youtu.be/eZXuoeTGuuU