Operations Research MCQ Multiple Choice Questions - Page 2 for Practice

Operations Research MCQ Questions for Practice

31. Allocation Models are

32. Allocation problems can be solved by

33. An assumption that implies that finite numbers of choices are available to a decision – maker and the decision variables do not assume negative values is known as

34. An objective function is maximized when it is a..........function

35. An optimal solution is the..........stage of a solution obtained by improving the initial solution

36. An optimization model

37. An optimum solution is considered the.............among feasible solutions.

38. Any column or raw of a simplex table is called a

39. Any feasible solution to a transportation problem containing m origins and n destinations is said to be

40. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called its

41. Any set of non.negative allocations (Xij>0) which satisfies the raw and column sum (rim requirement )is called a

42. Any solution to a LPP which satisfies the non. negativity restrictions of the LPP is called its

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

44. Assignment problem helps to find a maximum weight identical in nature in a weighted

45. Basic cells indicate positive values and non. basic cells have..........value for flow

46. Before starting to solve the problem, it should be balanced. If not then make it balanced by..........column incase demand is less than supply or by adding.........................raw incase supply is less than the demand

47. Currently, LPP is used in solving a wide range of practical

48. Decision variables are

49. Dual of the dual is

50. Every LPP is associated with another LPP is called

51. For analyzing the problem, decision – makers should normally study

52. For maximization in TP, the objective is to maximize the total

53. For solving an assignment problem, which method is used?

54. Graphic method can be applied to solve a LPP when there are only............variable

55. How many methods are there to solve LPP?

56. If demand is lesser than supply then dummy demand node is added to make it a

57. If in a LPP, the solution of a variable can be made infinity large without violating the constrai the solution is..................nts

58. If the feasible region of a LPP is empty, the solution is

59. If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with

60. If there are m original variables and n introduced variables, then there will be............columns in the simplex table

Tags

Multiple Choice Questions and Answers on Operations Research

Operations Research Multiple Choice Questions and Answers

Operations Research Trivia Quiz

Operations Research Question and Answer PDF Online


Your Score

0 Right Ans.
0 Wrong Ans.