Operations Research Set 10
On This Page
This set of Operations Research Multiple Choice Questions & Answers (MCQs) focuses on Operations Research Set 10
Q1 | Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Iconic models
- Analogue Models
- Symbolic Models
- None of the above
Q2 | Probabilistic models are also known as
- Deterministic Models
- Stochastic Models
- Dynamic Models
- Static Models
Q3 | ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time duringa particular period
- Static Models
- Dynamic Models
- Both A and B
- None of the above
Q4 | The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐
- Variables
- Constraints
- Functions
- All of the above
Q5 | Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐
- Tripartite graph
- Bipartite graph
- Partite graph
- None of the above
Q6 | All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐
- Variables
- Constraints
- Functions
- None of the above
Q7 | If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Infeasible
- Unbounded
- Alternative
- None of the above
Q8 | The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐
- Unit Variables
- Basic Variables
- Non basic Variables
- None of the above
Q9 | Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Vector
- Key column
- Key Raw
- None of the above
Q10 | Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Primal
- Dual
- Non‐linear programming
- None of the above
Q11 | As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐
- Profit
- optimization
- cost
- None of the above
Q12 | Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Primal
- Dual
- Alternative
- None of the above
Q13 | ‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems.
- Assignment problem
- Transportation problem
- Optimization Problem
- None of the above
Q14 | The quantitative approach to decision analysis is a
- Logical approach
- Rational approach
- Scientific approach
- All of the above
Q15 | Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐
- Agricultural
- Industrial applications
- Both A and B
- Manufacturing
Q16 | This method of formal calculations often termed as Linear Programming was developed later inwhich year?
- 1947
- 1988
- 1957
- 1944
Q17 | The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Diagonal lines
- Curved lines
- Straight lines
- Slanting lines
Q18 | The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐
- Systematically
- Rapidly
- Slowly
- Instantly
Q19 | LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Proportionality
- Additivity
- Certainty
- All of the above
Q20 | Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved bythe graphical method.
- One decision
- Four decisions
- Three decisions
- Two decisions
Q21 | Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐
- Unbounded solution
- Optimal solution
- Feasible solution
- Both A and B
Q22 | Any feasible solution which optimizes (minimizes or maximizes) the objective function ofthe LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Optimal solution
- Non‐basic variables
- Solution
- Basic feasible solution
Q23 | A non – degenerate basic feasible solution is the basic feasible solution which has exactlym positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
- Infinity
- One
- Zero
Q24 | What is also defined as the non‐negative variables which are added in the LHS of theconstraint to convert the inequality ‘< ‘ into an equation?
- Slack variables
- Simplex algorithm
- Key element
- None of the above
Q25 | In simplex algorithm , which method is used to deal with the situation where aninfeasible starting basic solution is given?
- Slack variable
- Simplex method
- M‐ method
- None of the above