NEW
Font size
Worksheetsoperations research
Total questions: 55
Worksheet time: 28mins
1. A feasible solution is said to be an ----- solution if it minimizes the total transportation
cost
A. non degenerate basic feasible
B. basic feasible
C. feasible
D. optimal
2. The another name of least cost method is ------
Vam
North west corner rule
Modi method
Matrix minima method
3. The number of non basic variables in the balanced transportation problem with 3 rows
and 5 columns is ------
15
7
8
9
4. An alternate optimal solution to a transportation problem is said to exist when one or
more of the unoccupied cells have zero value for the net cost change in the optimal
solution.
True
False
5. A transportation problem is said to be balanced if ------
Σ ai=Σ xi
Σ xi = Σ bi
Σ ai = Σ bi
Σ ai= Σ bi
6. Row wise and column wise difference between two minimum costs is calculated
under ---- method
Vam
Least cost
modi
north west corner
7. A Transportation problem is a special case of linear programming problem
False
True
A transportation problem can always be represented by balanced model.
False
True
9. A basic feasible solution to a (m x n) transportation problem is said to be a ------ solution if
it contains exactly m + n - 1 non negative allocations in independent positions
A. non degenerate basic feasible
B. basic feasible
C. feasible
D. infeasible
10. An alternative optimal solution to a minimization problem exists whenever opportunity
cost corresponding to unused route of transportation is
A. positive and greater than zero
B. positive with at least one equal to zero
C. negative with at least one equal to zero
D. none of the above
11. During an iteration while moving from one solution to the next , degeneracy may occur
when
A. the closed path indicates a diagonal move
B. two or more occupied cells on the closed path but neither of them represents a
corner of the path
C. two or more occupied cells on the closed path with minus sign are tied for lowest
circled value
D.none of the above
12.If a constant value is added to every cost element c ij in the transportation table, the optimal values of
the variables x ij will change.
true
false
13. To solve degeneracy, an unoccupied cell with ------------- cost is converted into occupied
cells by assigning an infinitely small amount to it.
Lowest
Highest
Normal
14.One disadvantage of using North - West Corner Rule to find initial solution to the
transportation problem is that
A. it is complicated to use
B. it does not take in to account cost of transportation
C. it leads to a degenerate initial solution
D. All of the above
15. A set of non negative values x ij , i = 1, 2, ----,m; j = 1, 2,----,n that satisfies the constraints is
called a ----- solution to the transportation problem.
degenerate
basic feasible
feasible
infeasible
1. Operations research is the application of ____________methods to arrive at the optimal Solutions to the problems.
Economical
Scientific
both a and b
none of the above
Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed ----------- --------------------------
A. Decision making
B. Management processes
C. Procedures
3. Which of the following is not the phase of OR methodology?
A. Formulating a problem
B. Constructing a model
C. Establishing control
D. Controlling the environment
4. The objective function and constraints are functions of two types of variables, _______________ variables and ____________ variables.
A. Positive and negative
B. Controllable and uncontrollabl
Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints?
A. Quailing Theory
B. Waiting Line
C. Both A and B
D. Linear Programming
The northwest corner rule requires that we start allocating units to shipping routes in the middle cell
A. Lower right corner of the table
B. Upper right corner of the table
C. Highest costly cell of the table.
D. Upper left-hand corner of the table.
The given TP is an example for
Unbalanced
Optimal
degenerate
infeasible
The given Transportation problems is an example for
unbalanced
feasible
degenerate
optimal
Which of the following is not needed to use the transportation model
the cost of shipping one unit from each origin to each destination
the destination points and the demand per period at each
the origin points and the capacity or supply per period at each
degeneracy
Which of the following is a method for improving an initial solution in a transportation problem?
northwest-corner
intuitive lowest-cost
Vogel's Approximation
Stepping stone method
Below are the reason why you study OM EXCEPT___________.
OM is one of three major functions (marketing, finance, and operations) of any organization
we want to understand what operations managers do
OM include performing market research, producing a marketing plan, as well as strategically overseeing advertising and promotion
we want (and need) to know how goods and services are produced
Which of the given answer is the characteristics of the services?
often knowledge base
production usually separate from consumption
can be inventoried
low customer interaction
Which one is the best describe for forecast approach on qualitative method?
Used when situation is stable and historical data exist.
Used when situation is vague and little data exist.
Involves mathematical techniques.
Forecast on existing product and current technology.
_____________________ involve managers from sales, marketing research, accounting and production. This managers assembles to discuss their opinion on what will happen to sales in future.
Jury of Executive Opinion
Delphi Method
Sales Force Composite
Market Survey
______________ assumes demand in next period is the same as demand in most recent period.
Moving average
Weighted Moving Average
Naive Approach
Exponential Smoothing
____________ each salesperson projects his or her sales then combined at district and national levels.
Jury of Executive Opinion
Delphi Method
Sales Force Composite
Market Survey
All of the answer below is the characteristics of the goods EXCEPT __________________________.
can be inventoried
site of facility important to minimize production cost
some aspects of quality measurable
reselling unusual
Below are the roles of operations manager EXCEPT _________.
planning on capacity, locations, products & services,make or buy, layout and do projects scheduling
develop an incentive plan, issuance of work orders & job assignment.
manage the inventory, control the quality, costs and productivity
produce financial reports and develop direct investment activities
Operations management _________________.
involve in obtain funds and tracks the finance performing
is the set of activities that transforming inputs into outputs
creates demand and get customers
involve the management of employee from recruitment to retirement
Which one is TRUE for the medium range forecast?
New product planning, facility location, research and development
Forecasts tend to be more accurate than longer-term forecasts
Purchasing, job scheduling, workforce levels, job assignments, production levels
Forecast on sales, production planning and budgeting.
If there is no feasible region of a LPP, then the solution is called as______
an optimum solution
an unbounded solution
feasible solution
infeasible solution
When the max value of Z occurs
at the point of infinity then the LPP is said to have
an optimum solution
an unbounded solution
no solution
infeasible solution
A Feasible solution in LP means
Variables that represent decisions
Any set of values for variables
A solution that satisfies all the constraints
A solution that does not satisfy all the constraints
A constraint of the type ≤ can be converted into an equation by adding a ______variable to the left side of the constraint
Surplus
Slack
Artificial
Decision
When the LPP is said to have an alternative optima, it has
one solution
more than one solution
an unbounded solution
no solution
When the number of unit vectors in a simplex table is equal to the number of constraints, then the table is said to be in
Standard Form
Primal Form
Canonical Form
Dual Form
We can solve a linear programming problem by simplex method if
Number of constraints is less than the number of decision variables.
Number of decision variables = Number of constraints
There are any number of constraints and any number of decision variables
Number of constraints is greater than number of decision variables
A basic solution to the system is called __________if one or more of the variables vanish
No feasible
Degenerate
Non- Degenerate
Multiple optimal
Decision variables are
the known values of the model.
the unknown that are to be determined by solving the model
variables not under the control of the decision maker
the variables that we introduce to bring it to standard form
Graphical method can be used to solve linear programming problems with
Two constraints
Two variables only
More than 2 variables
More than 2 constraints
Which of the following is not a property of all LPP
Optimization of objective
Computer programme
Non negativity restrictions
The presence of restrictions
In standard form, all constraints are expressed as
< =
> =
=
≠
The same sequence of simplex iteration repeated endlessly without improving the solution is called
Infeasible solution
Cycling
Unbounded solution
No solution
Simplex methods is a technique of solving
Transportation problem
Assignment problem
Linear Programming Problem
Inventory Problems
A feasible solution, which is also basic is called
Basic Solution
Infeasible Solution
Basic feasible solution
unbounded solution
The intersection of the pivot
column and pivot row is called
non pivot element
pivot element
row element
column element
Simplex method can be used to solve linear programming problems with
only three variables
Two or More variables
only 2 constraints
Only three constraints
The region which consists of all the points that satisfy all the constraints including the non – negativity restrictions is called
Infeasible region
Feasible Region
Annulus region
No Solution space
A basic solution to the system is called __________if one or more of the variables vanish.
No feasible
Degenerate
Non- Degenerate
Multiple optimal
Which of the following variable is subtracted from the left side of the constraint of the type “ ≥ ” to be converted to an equation?
Slack
Surplus
Artificial
Decision
