Vogel's approximation method is connected with(1 Point) 0 Assignment problem 0 Simplex problem 0 Transportation problem 0 Break even problem Simplex method of solving linear programming problem uses(1 Point) 0 all the points in the feasible region 0 only the corner points ofthe feasible region 0 intermediate points within the infeasible region 0 only the interior points in the feasible region If there are m sources and n destinations in a transportation matrix, the total number of basic variables in a basic feasible solution is('l Point) O m+n O m+n+1 O m+n-1 Om In order that linear programming technique provide valid results, (1 Point) Relations between factors must be positive linear. 0 Relations between factors must be negative linear' O aorb 0 none of the above While solving a linear programming model, if a redundant constraint is added, then what will be its effect to the existing solution?(1 Point) O No effect 0 solution will be constrained 0 solution becomes innite 0 no solution at all In a linear programming problem, the restrictions or limitations under which the objective function is to be optimized are called(1 Point) 0 Decision variables 0 Objectivefunetion O Constraints 0 linear program Hungarian algorithm is used to solve (1 Point) 0 Simple minimization 0 Break even point analysis 0 Assignment problem 0 Transportation problem In a transportation problem, rows are the supply points and the columns are the demand points. if total demand is less than the total supply. then(1 Point) O dummy column should be added. 0 dummy row should be added. 0 no need to add a row or column. 0 either a row or column can be added. The assignment problem is said to be unbalanced if(1 Point) 0 number of rows is greater than number of columns. 0 number of rows is lesser than number of columns. 0 number of rows is equal to number of columns 0 both 1 and 2. The application of assignment problem is to obtain (1 Point) O only minimum cost 0 only maximum prot 0 minimum cost or maximum prot 0 assign the jobs. in In order for a transportation matrix which has ve rows and four columns, not to be degenerate, how much must be the number of allocated cells in the matrix?(1 Point) 08 O9 023 024 'l3 The procedure for solving a minimization problem with simplex is exactly the same as solving a maximization problem but with one exception, which is :(1 Point) O the identication of the replaced row 0 the computation of the 01-2] values O the computation of the replacing row 0 the identication of the optimum column