The variables whose coefficient vectors are unit vectors are called ____________.

A. Unit Variables
B. Basic Variables
C. Non basic Variables
D. None of the above
✅ The correct answer is option B.
The variables whose coefficient vectors are unit vectors are called basic variables. The basic variables can be defined as the m variables which can take any value other than zero. Moreover, if the variables satisfy the non-negativity condition of the LP model, the basic solution created by them is called the basic feasible solution. The remaining variables are known as the non-basic variables.

Operations Research simply helps in improving the ______________ of the solution but does not in a perfect solution.

A. Quality
B. Clarity
C. Look
D. None of the above
✅ The correct answer is option A.
Operations Research simply helps in improving the quality of the solution but does not in a perfect solution. It implies that by applying its scientific approach, it can only improve the quality of solution but it may not be able to give perfect solution.

If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is _____________.

A. Infeasible
B. Unbounded
C. Alternative
D. None of the above
✅ The correct answer is option B.
If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is unbounded. An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have unbounded solution if its solution can be made infinitely large without violating any of its constraints in the problem.

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

A. Profit
B. optimization
C. cost
D. None of the above
✅ The correct answer is option A.
As for maximization in assignment problem, the objective is to maximize the Profit. An assignment problem is a particular case of transportation problem where the objective is to assign a number of resources to an equal number of activities so as to minimize total cost or maximize total profit of allocation.

A feasible solution to an LP problem.

A. Must satisfy all of the problem’s constraints simultaneously
B. Need not satisfy all of the constraints, only some of them
C. Must be a corner point of the feasible region
D. Must optimize the value of the objective function
✅ The correct answer is option A.
A feasible solution to an LP problem must satisfy all of the problem’s constraints simultaneously. A feasible solution is a set of values for the decision variables that satisfies all of the constraints in an optimization problem. A local optimal solution is one where there is no other feasible solution “in the vicinity” with a better objective function value.

Non-negativity condition is an important component of LP model because.

A. Variables value should remain under the control of the decision-maker
B. Value of variables make sense & correspond to real-world problems
C. Variables are interrelated in terms of limited resources
D. None of the above
✅ The correct answer is option B.
Non-negativity condition is an important component of LP model because value of variables make sense & correspond to real-world problems. Non-negativity restriction indicates that all decision variables must take on values equal to or greater than zero.