A feasible solution to a linear programming problem _________
1.must satisfy all the constraints of the problem simultaneously
2.need not satisfy all of the constraints, only some of them
3.must be a corner point of the feasible region.
4.must optimize the value of the objective function
Posted Date:-2021-12-04 00:24:06
A mixed strategy game can be solved by ______
1.Simplex method
2.Hungarian method
3.Graphical method
4.Degeneracy
Posted Date:-2021-12-04 00:30:42
A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input process at average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle for _____
1.3/5
2.4/5
3.5/3
4.6/5
Posted Date:-2021-12-04 00:29:30
A queuing system is said to be a ______________ when its operating characteristic are independent upon time
1.pure birth model
2.pure death model
3.transient state
4.steady state
Posted Date:-2021-12-04 00:37:19
A set of feasible solution to a Linear Programming Problem is _______
1.convex
2.polygon
3.triangle
4.bold
Posted Date:-2021-12-04 00:31:31
An activity which does not consume neither any resource nor time is known as ______
1.predecessor activity
2.successor activity
3.dummy activity
4.activity
Posted Date:-2021-12-04 00:37:43
An assignment problem is a particular case of ___________
1.transportation Problem
2.assignment Problem
3.travelling salesman problem
4.replacement Problem
Posted Date:-2021-12-04 00:35:10
An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost should be equal to the number of ______
1.rows or columns
2.rows and columns.
3.rows+columns- 1
4.rows-columns.
Posted Date:-2021-12-04 00:25:38
During iteration while moving from one solution to the next, degeneracy may occur when______
1.the closed path indicates a diagonal move
2.two or more occupied cells are on the closed path but neither of them represents a corner of the path.
3.two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
4.the closed path indicates a rectangle move.
Posted Date:-2021-12-04 00:42:03
For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost would ______
1.increase by 2.5%.
2.decrease by 2.5%.
3.increase by 0.25%.
4.decrease by 0.25%.
Posted Date:-2021-12-04 00:45:23
For any primal problem and its dual_______
1.optimal value of objective function is same
2.dual will have an optimal solution iff primal does too
3.primal will have an optimal solution iff dual does too
4.both primal and dual cannot be infeasible
Posted Date:-2021-12-04 00:24:53
If any value in XB column of final simplex table is negative, then the solution is _______
1.infeasible
2.infeasible
3.bounded
4.no solution
Posted Date:-2021-12-04 00:24:27
If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the existence of an ______
1.initial basic feasible solution
2.optimum basic feasible solution
3.optimum solution.
4.alternate optimum solution.
Posted Date:-2021-12-04 00:40:05
If the order quantity (size of order) is increased, ______
1.holding costs decrease and ordering costs increase
2.holding costs increase and ordering costs decrease
3.the total costs increase and then decrease
4.storage cost as well as stock-out cost increase
Posted Date:-2021-12-04 00:29:52
If the primal problem has n constraints and m variables then the number of constraints in the dual problem is ______
1.mn
2.m+n
3.m-n
4.m/n
Posted Date:-2021-12-04 00:32:16
If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is _____
1.feasible
2.bounded
3.unbounded
4.infinite
Posted Date:-2021-12-04 00:27:55
In an Linear Programming Problem functions to be maximized or minimized are called _______
1.constraints
2.objective function
3.basic solution
4.feasible solution
Posted Date:-2021-12-04 00:31:54
In marking assignments, which of the following should be preferred?
1.Only row having single zero
2.Only column having single zero
3.Only row/column having single zero
4.Column having more than one zero
Posted Date:-2021-12-04 00:29:07
In program evaluation review technique network each activity time assume a beta distribution because________
1.it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
2.it has got finite non-negative error
3.it need not be symmetrical about model value
4.the project is progressing well
Posted Date:-2021-12-04 00:27:33
In time cost trade off function analysis________
1.cost decreases linearly as time increases
2.cost increases linearly as time decreases
3.cost at normal time is zero
4.cost increases linearly as time increases
Posted Date:-2021-12-04 00:43:38
Key element is also known as _______
1.slack
2.surplus
3.artificial
4.pivot
Posted Date:-2021-12-04 00:32:59
Mathematical model of linear programming problem is important because _________
1.it helps in converting the verbal description and numerical data into mathematical expression
2.decision makers prefer to work with formal models
3.it captures the relevant relationship among decision factors
4.it enables the use of algebraic technique
Posted Date:-2021-12-04 00:40:33
Maximization assignment problem is transformed into a minimization problem by_______
1.adding each entry in a column from the maximum value in that column
2.subtracting each entry in a column from the maximum value in that column
3.subtracting each entry in the table from the maximum value in that table
4.adding each entry in the table from the maximum value in that table
Posted Date:-2021-12-04 00:42:26
Operations Research approach is _________
1.multi-disciplinary
2.scientific
3.intuitive
4.collect essential data
Posted Date:-2021-12-04 00:23:43
Priority queue discipline may be classified as___________
1.pre-emptive or non-pre-emptive
2.limited
3.unlimited
4.Finite
Posted Date:-2021-12-04 00:42:50
Replace an item when________
1.average cost upto date is equal to the current maintenance cost
2.average cost upto date is greater than the current maintenance cost
3.average cost upto date is less than the current maintenance cost.
4.next year running cost in more than average cost of nth year
Posted Date:-2021-12-04 00:43:13
Select the correct statement
1.EOQ is that quantity at which price paid by the buyer is minimum
2.If annual demand doubles with all other parameters remaining constant, the Economic Order Quantity is doubled
3.Total ordering cost equals holding cost
4.Stock out cost is never permitted
Posted Date:-2021-12-04 00:26:24
Service mechanism in a queuing system is characterized by __________
1.customers behavior
2.servers behavior
3.customers in the system
4.server in the system
Posted Date:-2021-12-04 00:26:46
The activity cost corresponding to the crash time is called the ______
1.critical time
2.normal time
3.cost slope
4.crash cost
Posted Date:-2021-12-04 00:31:08
The allocation cells in the transportation table will be called ______________ cell
1.occupied
2.unoccupied
3.no
4.Finite
Posted Date:-2021-12-04 00:33:59
The assignment algorithm was developed by ______________ method.
1.HUNGARIAN
2.VOGELS
3.MODI
4.TRAVELING SALES MAN
Posted Date:-2021-12-04 00:34:46
The assignment problem is always a ______________matrix.
1.circle
2.square
3.rectangle
4.triangle
Posted Date:-2021-12-04 00:38:55
The calling population is considered to be infinite when ______
1.all customers arrive at once
2.capacity of the system is infinite
3.service rate is faster than arrival rate
4.arrivals are independent of each other
Posted Date:-2021-12-04 00:28:20
The coefficient of slacksurplus variables in the objective function are always assumed to be ______
1.0
2.1
3.M
4.-M
Posted Date:-2021-12-04 00:35:33
The customers of high priority are given service over the low priority customers is _________
1.Pre emptive
2.FIFO
3.LIFO
4.SIRO
Posted Date:-2021-12-04 00:36:58
The difference between total and free float is _______
1.total
2.free
3.independent
4.interference
Posted Date:-2021-12-04 00:38:08
The difference between total float and head event slack is _________
1.free float
2.independent float
3.interference float
4.linear float
Posted Date:-2021-12-04 00:25:15
The minimum number of lines covering all zeros in a reduced cost matrix of order n can be ________
1.at the most n
2.at the most n
3.n-1
4.n+1
Posted Date:-2021-12-04 00:44:58
The non basic variables are called _________
1.shadow cost
2.opportunity cost
3.slack variable
4.surplus variable
Posted Date:-2021-12-04 00:32:38
The number of time estimates involved in Program Evaluation Review Technique problem is ______
1.1
2.2
3.3
4.4
Posted Date:-2021-12-04 00:38:32
The objective of network analysis is to______
1.minimize total project duration
2.minimize toal project cost
3.minimize toal project cost
4.maximize total project duration
Posted Date:-2021-12-04 00:27:09
The right hand side constant of a constraint in a primal problem appears in the corresponding dual as_________
1.a coefficient in the objective function
2.a right hand side constant of a function
3.an input output coefficient a left hand side constraint
4.coefficient variable
Posted Date:-2021-12-04 00:41:37
The slack variables indicate ______
1.excess resource available.
2.shortage of resource
3.nil resource
4.idle resource
Posted Date:-2021-12-04 00:39:40
The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ______
1.m+n
2.mn
3.m-n
4.m+n-1
Posted Date:-2021-12-04 00:33:32
The transportation problem deals with the transportation of _______
1.a single product from a source to several destinations
2.a single product from several sources to several destinations
3.a single product from several sources to a destination
4.a multi -product from several sources to several destinations
Posted Date:-2021-12-04 00:44:33
To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______
1.n
2.n-1
3.2n-1
4.n-2
Posted Date:-2021-12-04 00:26:00
To resolve degeneracy at the initial solution, a very small quantity is allocated in _______ cell
1.occupied
2.unoccupied
3.no
4.Finite
Posted Date:-2021-12-04 00:34:25
Using ______________ method, we can never have an unbounded solution
1.Simplex
2.Dual simplex
3.Big M
4.modi
Posted Date:-2021-12-04 00:36:01
While solving a linear programming problem infeasibility may be removed by _______
1.adding another constraint
2.adding another variable
3.removing a constraint
4.removing a variable
Posted Date:-2021-12-04 00:41:12
_________ is a mathematical technique used to solve the problem of allocating limited resource among the competing activities
1.Linear Programming problem
2.Assignment Problem
3.Replacement Problem
4.Non linear Programming Problem
Posted Date:-2021-12-04 00:30:13