The mathematical technique for finding the best use of limited resources in an optimum manner is known as
In case of solution of linear programming problem using graphical method, if the constraint line of one of the non-redundant constraints is parallel to the objective function line, then it indicates
In an LPP if one of the decision variable is zero then the solution is
Which of the following is a correct expression for an objective function in an LPP?
In the solution of a linear programming problem by Simplex method, if during iteration, all ratios of right-hand side bi to the coefficients of entering variable a are found to be negative, it implies that the problem has
The simplex method is the basic method for
Which one of the following is true in case of simplex method of linear programming?
Iterative solution: The steps keep on repeating until we get an optimal solution.
A feasible solution to the linear programming problem should
A feasible solution to the linear programming problem should satisfy the problem constraints
A tie for leaving variables in simplex procedure implies
On solving an LPP using simplex method, the optimality is reached for a maximization problem when
Linear programming can be used to solve
Graphical method, simplex method, and transportation method are concerned with
Which one of the following is not the solution method of transportation problems?
Which one of the following conditions should be satisfied for the application of optimality test on an initial solution of transportation model?
Consider the following statements: In a transportation problem, North-West corner method would yield
1. An optimum solution
2. An initial feasible solution
3. Vogel’s approximate solution
Of these statements
The Hungarian algorithm for solving an assignment problem requires a
The solution in a transportation model (of dimension m × n) is said to be degenerate if it has
Which one of the following is the correct statement? In the standard form of a linear programming problem, all constraints are
The number of basic variables in a simplex method is equal to
The primal of a LP problem is maximization of objective function with 6 variables and 2 constraints. Which of the following correspond to the dual of the problem stated?
1. It has 2 variables and 6 constraints
2. It has 6 variables and 2 constraints
3. Maximization of objective function
4. Minimization of objective function
Select the correct answer using the codes given below