Operation Research Type A

Q: 1- Game theory was developed by

a)John von Newman
b) Euler
c) None of these

Q: 2- A game in which players is called

a) Two sum game
b) Two- player game
c) N player (person game)
d) None of the above

Q: 3- If a game is such that where it is played the sum of the gains (pay-off) of the players in Zero it is called –

a) Two player game
b) Zero sum game
c) N-person game
d) None of the above

Q: 4- A player is the predetermined rule by which he chooses his course of action while playing the game is called –

a) Strategy
b) Morra Game
c) Zero –Sum game
d) None of the above

Q: 5- A game of a player is his precession to adopt a specified course of action (Say Ar) irrespective of the strategy of the opponent.

a) Pure Strategy
b) Strategy
c) Mixed Strategy
d) None of the above

Q: 6- Playing a game of a player is his pr-decision to choose his course of action according to certain pre-assigned probabilities –

a) Mixed Strategy
b) Pure strategy
c) Strategy
d) None of the above

Q: 7- The row minimum in the pay-off matrix is called:

a) Mini max
b) Maxi min
c) Pay-off
d) None of the above

Q: 8- The minimum of the maximum in the pay matrix is called –

a) Mini max
b) Maxi min
c) Saddle point
d) None of the above

Q: 9- The post where the maxi min and mini max is called –

a) Saddle
b) Zero-sum game
c) Optimal Strategy
d) None of the above

Q: 10- The value of a game is the expected gain of player. A when both the player adopts strategy. A game is said to be fair if its value is –

a) Zero
b) Pay-off
c) Min Max
d) None of the above

Q: 1- Objective function States mathematically what is being maxi med.

a) Cost or scrap
b) Profit or present value
c) Scrape Variable
d) None of the above

Q: 2- Objective function States mathematically what is being minimized Operation research

a) Cost or scrap
b) Profit or present value
c) Scrape Variable
d) None of the above

Q: 3- ________ represent choices that the decision maker can control.

a) Decision variable
b) Constraints
c) None of these

Q: 4- ________ are limitations that restrict the permissible cho9ise for the decision variable.

a) Feasible Region
b) Decision Variable
c) Constants
d) All the above

Q: 5- __________ represents all permissible combinations of the decision variable.

a) Parameter
b) Feasible Region
c) Constraint
d) All the above

Q: 6- ________is a value that the decision makes con not control and that doesn’t change when the solution is implemented.

a) Para metes
b) Constraint
c) Decision
d) None of the above

Q: 7- The objective function and constraint and addictively these can be no products (eq, x1, x2) or power (eq, x1) of decision variables.

a) Parameter
b) Linearity
c) Formulate
d) None of the above

Q: 8- _______which means that the decision variables must be positive or zero-

A) None –negativity
b) Negativity
c) None of the above

Q: 9- Linear programming application begin with the of model the problem with the general characteristics

a) Optimal
b) Formulate
c) None of the above

Q: 10- linear programming problems are solved with the computer the meaning of the computer output and linear programming concepts can be gained by analyzing a simple two-variable problem with the ———method.

a) Linear programming
b) Graphic method
c) 2-Way method
d) All the above