Operations Research Set 7

Bachelor of Computer Applications (BCA),

Bachelor of Management Studies (BMS)

Practice Mode Previous Next
On This Page

This set of Operations Research Multiple Choice Questions & Answers (MCQs) focuses on Operations Research Set 7

Q1 | The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Diagonal lines
  • Curved lines
  • Straight lines
  • Slanting lines
Answer: Straight lines
Q2 | The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Systematically
  • Rapidly
  • Slowly
  • Instantly
Answer: Systematically
Q3 | Who originally called it ‘ Programming of interdependent activities in a linear structure’ but latershortened it to ‘ Linear Programming’ ?
  • Dantzig
  • Kantorovich
  • Marshall
  • None of the above
Answer: Dantzig
Q4 | LP can be applied in farm management problems is relates to the allocation of resources such as‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ , in such a way that is maximizes net revenue
  • Acreage
  • Labour
  • Water supply or working capital
  • All of the above
Answer: All of the above
Q5 | LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Proportionality
  • Additivity
  • Certainty
  • All of the above
Answer: All of the above
Q6 | ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the prior knowledge of all the coefficients in the objectivefunction, the coefficients of the constraints and the resource values.
  • Proportionality
  • Certainty
  • Finite choices
  • Continuity
Answer: Certainty
Q7 | Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by thegraphical method.
  • One decision
  • Four decisions
  • Three decisions
  • Two decisions
Answer: Two decisions
Q8 | 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
Answer: Feasible solution
Q9 | Any feasible solution which optimizes (minimizes or maximizes) the objective function of theLPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Optimal solution
  • Non‐basic variables
  • Solution
  • Basic feasible solution
Answer: Optimal solution
Q10 | A non – degenerate basic feasible solution is the basic feasible solution which has exactly mpositive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Infinity
  • One
  • Zero
  • X
Answer: Zero
Q11 | What is also defined as the non‐negative variables which are added in the LHS of the constraintto convert the inequality ‘< ‘ into an equation?
  • Slack variables
  • Simplex algorithm
  • Key element
  • None of the above
Answer: Slack variables
Q12 | Which method is an iterative procedure for solving LPP in a finite number of steps ?
  • Simplex algorithm
  • Slack variable
  • M method
  • Simplex method
Answer: Simplex method
Q13 | In simplex algorithm , which method is used to deal with the situation where an infeasiblestarting basic solution is given?
  • Slack variable
  • Simplex method
  • M‐ method
  • None of the above
Answer: M‐ method
Q14 | How many methods are there to solve LPP?
  • Three
  • Two
  • Four
  • None of the above
Answer: Two
Q15 | ‐‐‐‐‐‐‐‐‐‐‐‐ is another method to solve a given LPP involving some artificial variable ?
  • Big M method
  • Method of penalties
  • Two‐phase simplex method
  • None of the above
Answer: Two‐phase simplex method
Q16 | Which variables are fictitious and cannot have any physical meaning ?
  • Optimal variable
  • Decision variable
  • Artificial variable
  • None of the above
Answer: Artificial variable
Q17 | An objective function which states the determinants of the quantity to be either maximized orminimized is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Feasible function
  • Optimal function
  • Criterion function
  • None of the above
Answer: Criterion function
Q18 | An assumption that implies that finite numbers of choices are available to a decision – makerand the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Certainty
  • Continuity
  • Finite choices
  • None of the above
Answer: Finite choices
Q19 | A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐
  • Solution
  • Variable
  • Linearity
  • None of the above
Answer: Solution
Q20 | A basic solution which also satisfies the condition in which all basic variables are non ‐negativeis called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Basic feasible solution
  • Feasible solution
  • Optimal solution
  • None of the above
Answer: Basic feasible solution
Q21 | All the constraints are expressed as equations and the right hand side of each constraint and allvariables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Canonical variable
  • Canonical form
  • Canonical solution
  • Both A and B
Answer: Canonical form
Q22 | An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function
  • Passive
  • Profit
  • Cost
  • None of the above
Answer: Profit
Q23 | LPP is exactly used in solving what kind of resource allocation problems?
  • Production planning and scheduling
  • Transportation
  • Sales and advertising
  • All of the above
Answer: All of the above
Q24 | Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Business problems
  • Agricultural problems
  • Manufacturing problems
  • None of the above
Answer: Business problems
Q25 | ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ refers to the combination of one or more inputs to produce a particular output.
  • Solution
  • variable
  • Process
  • None of the above
Answer: Process
Previous Next