# Computer Based Optimization Techniques - Questions & Answers for Competitive Exams | GkSeries

Questions
37. In the network, only one activity may connect any _______ nodes
• [A] 1
• [B] 2
• [C] 3
• [D] 4

38. f the constraint of an LPP has an in equation of less than or equal to type, the variables to be added are __________.
• [A] slack
• [B] surplus
• [C] artificial
• [D] decision

39. A feasible solution of an LPP that optimizes then the objective function is called _________
• [A] basic feasible solution
• [B] optimum solution
• [C] feasible solution
• [D] solution

40. The cost of a slack variable is _________.
• [A] 0
• [B] 1
• [C] 2
• [D] -1

41. The cost of a surplus variable is _________
• [A] 0
• [B] 1
• [C] 2
• [D] -1

42. In an LPP functions to be maximized or minimized are called ___________.
• [A] constraints
• [B] objective function
• [C] basic solution
• [D] feasible solution

43. LPP that can be solved by graphical method has______.
• [A] linear constraints
• [C] non linear constraints

44. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• [A] mn
• [B] m+n
• [C] m-n
• [D] m/n

45. The area bounded by all the given constraints is called _____________.
• [A] feasible region
• [B] basic solution
• [C] non feasible region
• [D] optimum basic feasible solution

46. The non basic variables are called ___________.
• [B] opportunity cost
• [C] slack variable
• [D] surplus variable

47. If the given Linear Programming Problem is in its standard form then primal-dual pair is _______
• [A] symmetric
• [B] unsymmetric
• [C] slack
• [D] square

48. The dual of the dual is ____________.
• [A] dual-primal
• [B] primal-dual
• [C] dual
• [D] primal