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

Questions
25. _____________is used to reduce the game.
• [A] Transportation Problem
• [B] Assignment Problem
• [C] Dual simplex method
• [D] Graphical Method

26. _____is a mathematical technique used to solve the problem of allocating limited resource among the competing activities
• [A] Linear Programming problem
• [B] Assignment Problem
• [C] Replacement Problem
• [D] Non linear Programming Problem

27. Traveling salesman problem will have a total of _____different sequences.
• [A] n!
• [B] n-1
• [C] (n-a)!.
• [D] n

28. If there exists a saddle point for a given problem it, implies that the players are using ______strategies.
• [A] Pure
• [B] Mixed
• [C] Optimal
• [D] Pure and Mixed

29. FCFS refers to _______in queueing theory.
• [A] First Come First Serve
• [B] Last In First Out
• [C] Service In Random Order
• [D] Fastest Server Rule

30. SIRO refers to _______in queueing theory.
• [A] First In First Out
• [B] Last In First Out
• [C] Service In Random Order
• [D] Fastest Server Rule

31. If a customers decides not to enter the queue since it is too long is called_________.
• [A] balking
• [B] reneging
• [C] jockeying
• [D] queue

32. When there are two or more parallel queues and customer move from one queue to another queue it is called___________
• [A] balking
• [B] reneging
• [C] jockeying
• [D] system capacity

33. If the operating characteristic vary within time is called_____.
• [A] balking
• [B] reneging
• [C] transient state

34. The __________ time for an activity can be reduced by using increased resources.
• [A] normal
• [B] optimistic
• [C] pessimistic
• [D] most likely

35. Graphical method of linear programming is useful when the number of decision variable are _______
• [A] 2
• [B] 3
• [C] 4
• [D] 1

36. The activity cost corresponding to the crash time is called the _____.
• [A] critical time
• [B] normal time
• [C] cost slope
• [D] crash cost