Related Posts

Q. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐ ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected

Q. A basic solution which also satisfies the condition in which all basic variables are non ‐ negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐

Q. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐

Q. For solving an assignment problem, which method is used?

Q. A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. ‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems.