Any column or raw of a simplex table is called a __________.
A. Vector
B. Key column
C. Key Raw
D. None of the above
Select an option to see the answer and solution.
If there are ‘m’ original variables and ‘n’ introduced variables, then there will be _____________ columns in the simplex table.
A. M + n
B. M – n
C. 3 +m + n
D. M + n – 1
Select an option to see the answer and solution.
A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the _____________.
A. Constraints
B. Objective Functions
C. Both A and B
D. None of the above
Select an option to see the answer and 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
Select an option to see the answer and solution.
In maximization cases, _____________ are assigned to the artificial variables as their coefficients in the objective function.
A. +m
B. –m
C. 0
D. None of the above
Select an option to see the answer and solution.
In simplex method, we add _____________ variables in the case of ‘=’.
A. Slack Variable
B. Surplus Variable
C. Artificial Variable
D. None of the above
Select an option to see the answer and solution.
In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, __________ should be selected.
A. Slack variable
B. Surplus variable
C. Decision variable
D. None of the above
Select an option to see the answer and solution.
A BFS of a LPP is said to be ________________ if at least one of the basic variable is zero.
A. Degenerate
B. Non_degenerate
C. Infeasible
D. Unbounded
Select an option to see the answer and solution.
In LPP, degeneracy occurs in ____________ stages.
Select an option to see the answer and solution.
Every LPP is associated with another LPP is called ______________.
A. Primal
B. Dual
C. Non_linear programming
D. None of the above
Select an option to see the answer and solution.
As for maximization in assignment problem, the objective is to maximize the ___________.
A. Profit
B. optimization
C. cost
D. None of the above
Select an option to see the answer and solution.
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
Select an option to see the answer and solution.
Operations Research involves ______________ attack of complex problems to arrive at the optimum solution.
A. Scientific
B. Systematic
C. Both A and B
D. Statistical
Select an option to see the answer and solution.
Operations Research uses models built by quantitative measurement of the variables of a given problem and also derives a solution from the model using _____________ of the diversified solution techniques.
A. Two or more
B. One or more
C. Three or more
D. Only One
Select an option to see the answer and solution.
A solution may be extracted from a model either by.
A. Conducting experiments on it
B. Mathematical analysis
C. Both A and B
D. Diversified Techniques
Select an option to see the answer and solution.
Operations Research uses models to help the management to determine its ___________ scientifically.
A. Policies
B. Actions
C. Both A and B
D. None of the above
Select an option to see the answer and solution.
The mathematical model of an LP problem is important because.
A. It helps in converting the verbal description & numerical data into mathematical expression
B. Decision-makers prefer to work with formal models
C. It captures the relevant relationship among decision factors
D. It enables the use of algebraic technique
Select an option to see the answer and solution.
Operations Research is a ____________.
A. Science
B. Art
C. Mathematics
D. Both A and B
Select an option to see the answer and solution.
What have been constructed for Operations Research problems and methods for solving the models that are available in many cases?
A. Scientific Models
B. Algorithms
C. Mathematical Models
D. None of the above
Select an option to see the answer and solution.
Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost minimization under certain constraints?
A. Quailing Theory
B. Waiting Line
C. Both A and B
D. Linear Programming
Select an option to see the answer and solution.