Description : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these
Last Answer : d. None of the these
Description : Straight lines shown in a linear programming graph indicates ........................... a. Objective function b. Constraints c. Points d. All of the above
Last Answer : b. Constraints
Description : When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate
Last Answer : c. Degenerate
Description : A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal ... set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables
Last Answer : d)Cross product relationships exist between two or more decision variables
Description : A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above
Last Answer : d. All of the above
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Last Answer : d. Spread Sheet
Description : Graphic method can be applied to solve a liner programming problem when there are only ........................... variables a. A one b. Two c. Three d. More than three
Last Answer : b. Two
Description : Which of the following method is used to solve mixed strategy problems: a. Probability method b. Graphic method c. Linear Programming method d. All of the above
Description : Which of the followings is an assumption of Linear Programming Technique? a. Divisibility b. Additivity c. Proportionality d. All of the above
Description : Linear Programming Technique helps to find an optimal use of: a. Machine b. Money c. Manpower d. All of the above
Description : Linear Programming technique is a: a. Constrained optimisation technique b. Technique for economic allocation of resources c. Mathematical technique d. All of the above
Description : ............................... is concerned with determination of the most economic replacement policy. a. Probabilistic programming b. Linear programming c. Search theory d. Replacement theory
Last Answer : d. Replacement theory
Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these
Last Answer : b. Dual
Description : In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four
Description : .................... is considered as the pioneer of Linear Programming Technique. a. churchman b. D W Miller c. James Lundy d. George B Dantzig
Last Answer : d. George B Dantzig
Description : If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative
Last Answer : b. Infeasible
Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b
Last Answer : b. A travelling salesman problem
Description : ........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these
Last Answer : b. Linear programming
Description : Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above
Description : 30. The distinguishing feature of an LP model is a. Relationship among all variables is linear b. It has single objective function & constraints c. Value of decision variables is non-negative d. All of the above
Last Answer : a. Relationship among all variables is linear
Description : Non-negativity constraints are written as ...................... a. Equality b. Non-equality c. Greater than or equal to d. Less than or equal to
Last Answer : c. Greater than or equal to
Description : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these
Last Answer : a. Feasible region
Description : Constraints in an LPP are treated as active, if they: a. Do not consume all the available resources at optimality b. Represent optimal solution c. Both a and b d. None of these
Last Answer : b. Represent optimal solution
Description : In simplex method, we add .......................... in the case of constraints with sign “=” a. Surplus variable b. Artificial variable c. Slack variable d. None of these
Last Answer : b. Artificial variable
Description : In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .............................. a. Infeasible b. Alternative c. Unbounded d. Unique
Last Answer : c. Unbounded
Description : A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... a. Constraints b. Objectives c. Both a and b d. None of these
Last Answer : b. Objectives
Description : The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above
Last Answer : a. Satisfy rim constraints
Description : ..................... are expressed in the form of equations a. Objectives b. Constraints c. Both a and b d. None of these
Description : Commonly assumed probability distribution of service pattern are ....................... a. Poisson distribution b. Exponential distribution c. Erlang distribution d. b and c
Last Answer : d. b and c
Description : Commonly assumed probability distribution of arrival pattern is ....................... a. Poisson distribution b. Binomial distribution c. Normal distribution d. None of these
Last Answer : a. Poisson distribution
Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables
Last Answer : d. Decision variables
Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : b. Uncontrollable variables
Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : a. Controllable variables
Description : ........................variables are fictitious and cannot have any physical meaning. a. Slack variables b. Surplus variables c. Artificial variables d. Decision variables
Last Answer : c. Artificial variables
Description : In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in the objective function. a. + m b. – m c. 0 d. None of these
Last Answer : a. + m
Description : The variables whose coefficient vectors are unit vectors, are called ...................... a. Unit variables b. Basic variables c. Non-basic variables d. None of these
Last Answer : b. Basic variables
Description : If there are more than one optimal solutions for the decision variables, the solution is ........... a. Infeasible b. Unbounded c. Alternative d. None of these
Last Answer : c. Alternative
Description : ........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these
Last Answer : b. Static
Description : ...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory
Last Answer : c. Markov Analysis
Description : The graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above
Description : …………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer. A) Keywords B) Identifiers C) Constraints D) Strings
Last Answer : B) Identifiers
Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock
Last Answer : d. F L Hitchcock
Description : ......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these
Last Answer : a. Network
Description : ........................ model is a map which indicates roads, highways, towns and inter- relationships a. Iconic model b. Analogue model c. Mathematical model d. None of these
Last Answer : b. Analogue model
Description : An organisation chart is an example of ........................... a. Iconic model b. Mathematical model c. Analogue model d. None of these
Last Answer : c. Analogue model
Description : ............................... is used to imitate an operation prior to actual performance. a. Inventory control b. Simulation c. Game theory d. Integrated Production Model
Last Answer : b. Simulation
Description : A model is a ........................... a. An essence of reality b. An approximation c. An idealisation d. All of the above
Description : Neural Networks are complex ______________ with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions
Last Answer : a) Linear Functions
Description : Neural Networks are complex ______________with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions
Last Answer : b) Nonlinear Functions
Description : Neural Networks are complex ———————–with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions e) Power Functions