Description : 63. Graphic method can be applied to solve a LPP when there are only ____ variable a. Four b. More than one c. Two d. three
Last Answer : Which oil is used in the floatation method for the purification of ores?
Description : _____ is another method to solve a given LPP involving some artificial variable? a. Big M method b. Method of penalties c. Two-phase simplex method d. None of the above
Last Answer : a. Big M method
Description : Every LPP is associated with another LPP is called_____ a. Primal b. Dual c. Non-linear programming d. None of the above
Last Answer : b. Dual
Description : A BFS of a LPP is said to be ______ if at least one of the basic variable is zero a. Degenerate b. Non-degenerate c. Infeasible d. unbounded
Last Answer : a. Degenerate
Description : If in a LPP, the solution of a variable can be infinity large without violating the constraints, the solution is ___ a. Infeasible b. Unbounded c. Alternative d. None of the above
Last Answer : b. Unbounded
Description : ________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above
Last Answer : b. Transportation problem
Description : BFS in LPP stands for: a. Best Feasible solution b. Better feasible solution c. Basic feasible solution d. None of the above
Last Answer : c. Basic feasible solution
Description : Currently, LPP is used in solving a wide range of practical ___________ a. Business problems b. Agricultural problems c. Manufacturing problems d. None of the above
Last Answer : a. Business problems
Description : LPP is exactly used in solving what kind of resource allocation problems? a. Production planning and scheduling b. Transportation c. Sales and advertising d. All of the above
Last Answer : d. All of the above
Description : A set of values X1,X2……..Xn which satisfies the constraints of the LPP is called_______ a. Solution b. Variable c. Linearity d. None of the above
Last Answer : a. Solution
Description : 66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variable c. Big M method d. Simplex method
Last Answer : d. Simplex method
Description : 65. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called as _______ a. Optimal solution b. Non-basic variables c. Solution d. Basic Feasible solution
Last Answer : a. Optimal solution
Description : 64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above
Last Answer : a. Infeasible
Description : 12. Operations Research involves various _______ to solve the problems a. Decisions b. Study c. Technique d. Applications
Last Answer : c. Technique
Description : 10. There is a great scope for ______ working as a team to solve problems of defence by using the Operations Research approach a. Economists b. Administrators c. Statisticians and Technicians d. All of the Above
Last Answer : d. All of the Above
Description : What network model enables engineer managers to schedule, monitor and control large and complex projects by employing three time estimates per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation
Last Answer : b. Program evaluation review technique
Description : 59. Alternative solutions exist of an LP model when a. One of the constraints is redundant b. Objective function equation is parallel to one of the constraints c. Two constraints are parallel d. All of the above
Last Answer : b. Objective function equation is parallel to one of the constraints
Description : 55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above
Last Answer : a. The problem is infeasible
Description : 54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above
Last Answer : d. None of the above
Description : Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix
Last Answer : b. Payoff
Description : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player
Last Answer : Player
Description : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game
Last Answer : c. Play
Description : A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy
Last Answer : d. Impure strategy
Description : A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy
Last Answer : c. Complete strategy
Description : The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains
Last Answer : b. Strategies
Description : A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called___ a. Centre point b. Main point c. Saddle point d. Equal point
Last Answer : c. Saddle point
Description : In a game, the alternatives or courses of action available to each player are called _____ a. Options b. Choices c. Actions d. strategies
Last Answer : d. strategies
Description : The participants in a game are called ______ a. Clients b. Members c. Customers d. Players
Last Answer : d. Players
Description : . In a zero-sum game, a. What one player wins, the other loses b. The sum of each player’s winnings if the game is played many times must be zero c. The game is fair-each person has an equal chance of winning d. Long-run profits must be zero
Last Answer : a. What one player wins, the other loses
Description : A common assumption about the players in a game is that a. Neither player knows the payoff matrix b. The players have different information about the payoff matrix c. Only one of the players pursues a rational strategy d. The specific identify of the players is irrelevant to the play of the game
Last Answer : d. The specific identify of the players is irrelevant to the play of the game
Description : A strategy that is best regardless of what rival players do is called a. First-mover advantage b. A Nash equilibrium strategy c. Tit-for-tat d. A dominant strategy
Last Answer : d. A dominant strategy
Description : In game theory, the outcome or consequence of a strategy is referred to as the a. Payoff b. Penalty c. Reward d. End-game strategy
Last Answer : a. Payoff
Description : What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point
Last Answer : c. Imbalanced growth point
Last Answer : a. Equilibrium point
Description : Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.
Last Answer : c. Neumann Morgenstern
Description : In project crashing, as we systematically, crash the project, direct cost of project ______ a. Increases b. Decreases c. Remain same d. None of the above
Last Answer : a. Increases
Description : Floats for critical activities will be always _____ a. One b. Zero c. Highest d. Same as duration of the activity
Last Answer : b. Zero
Description : An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important
Last Answer : c. Critical
Description : Backward pass calculations are done to find ________ occurrence times of events a. Tentative b. Definite c. Latest d. Earliest
Last Answer : c. Latest
Description : Forward pass calculations are done to find _____ occurrence times of events a. Exact b. Earliest c. Latest d. Approximate
Last Answer : b. Earliest
Description : The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical
Last Answer : c. Sub-critical
Description : Pick up the incorrect statement from the following a. The activity which consumes maximum time, is called a node b. The activity is the time consuming part of a project c. The beginning ... of a job, are called events d. Logically and sequentially connected activities and events form a network
Last Answer : a. The activity which consumes maximum time, is called a node
Description : In a PERT network, the earliest(activity) start time is the a. Earliest time that an activity can be finished without delaying the entire project b. Latest time that an activity can ... of precedence requirements d. Latest time that an activity can be finished without delaying the entire project
Last Answer : c. Earliest time that an activity can be started without violation of precedence requirements
Description : The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.
Last Answer : a. PERT deals with events and CPM with activities
Description : At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and ... c. Difference between latest start and early finish d. Difference between latest start and latest finish
Last Answer : c. Difference between latest start and early finish
Description : . In what year was PERT developed? a. 1957 b. 1959 c. 1960 d. 1958
Last Answer : . 1957
Description : The CPM was developed by Rand and Walker in which year? a. 1957 b. 1958 c. 1959 d. 1960
Last Answer : a. 1957
Description : What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate ... that the project will be completed by a specific date d. All of the above
Description : For a project manager to have an effective means of identifying and communicating the planned activities and their interrelationships, he must use a network technique. One of the network ... evaluation review technique c. Path evaluation review technique d. Project execution review technique
Description : What network model enables engineer managers to schedule, monitor and control large and complex projects by using only one time factor per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation