wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

operations research

Total questions: 55

Worksheet time: 28mins

Name
Class
Date
1.

1. A feasible solution is said to be an ----- solution if it minimizes the total transportation

cost

a)

A. non degenerate basic feasible

b)

B. basic feasible

c)

C. feasible

d)

D. optimal

2.

2. The another name of least cost method is ------

a)

Vam

b)

North west corner rule

c)

Modi method

d)

Matrix minima method

3.

3. The number of non basic variables in the balanced transportation problem with 3 rows

and 5 columns is ------

a)

15

b)

7

c)

8

d)

9

4.

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.

a)

True

b)

False

5.

5. A transportation problem is said to be balanced if ------

a)

Σ ai=Σ xi\Sigma\ a_i=\Sigma\ x_i  

b)

Σ xi =  Σ bi\Sigma\ x_{i\ }=\ \ \Sigma\ b_i  

c)

Σ ai  =  Σ bi\Sigma\ a_i\ \ =\ \ \Sigma\ b_i  

d)

Σ  ai  Σ bi\Sigma\ \ a_i\ne\ \ \Sigma\ b_i  

6.

6. Row wise and column wise difference between two minimum costs is calculated

under ---- method

a)

Vam

b)

Least cost

c)

modi

d)

north west corner

7.

7. A Transportation problem is a special case of linear programming problem

a)

False

b)

True

8.

A transportation problem can always be represented by balanced model.

a)

False

b)

True

9.

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)

A. non degenerate basic feasible

b)

B. basic feasible

c)

C. feasible

d)

D. infeasible

10.

10. An alternative optimal solution to a minimization problem exists whenever opportunity

cost corresponding to unused route of transportation is

a)

A. positive and greater than zero

b)

B. positive with at least one equal to zero

c)

C. negative with at least one equal to zero

d)

D. none of the above

11.

11. During an iteration while moving from one solution to the next , degeneracy may occur

when

a)

A. the closed path indicates a diagonal move

b)

B. two or more occupied cells on the closed path but neither of them represents a

corner of the path

c)

C. two or more occupied cells on the closed path with minus sign are tied for lowest

circled value

d)

D.none of the above

12.

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.

a)

true

b)

false

13.

13. To solve degeneracy, an unoccupied cell with ------------- cost is converted into occupied

cells by assigning an infinitely small amount to it.

a)

Lowest

b)

Highest

c)

Normal

14.

14.One disadvantage of using North - West Corner Rule to find initial solution to the

transportation problem is that

a)

A. it is complicated to use

b)

B. it does not take in to account cost of transportation

c)

C. it leads to a degenerate initial solution

d)

D. All of the above

15.

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.

a)

degenerate

b)

basic feasible

c)

feasible

d)

infeasible

16.

1. Operations research is the application of ____________methods to arrive at the optimal Solutions to the problems.

a)

Economical

b)

Scientific

c)

both a and b

d)

none of the above

17.

Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed ----------- --------------------------

a)

A. Decision making

b)

B. Management processes

c)

C. Procedures

18.

3. Which of the following is not the phase of OR methodology?

a)

A. Formulating a problem

b)

B. Constructing a model

c)

C. Establishing control

d)

D. Controlling the environment

19.

4. The objective function and constraints are functions of two types of variables, _______________ variables and ____________ variables.

a)

A. Positive and negative

b)

B. Controllable and uncontrollabl

20.

Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints?

a)

A. Quailing Theory

b)

B. Waiting Line

c)

C. Both A and B

d)

D. Linear Programming

21.

The northwest corner rule requires that we start allocating units to shipping routes in the middle cell

a)

A. Lower right corner of the table

b)

B. Upper right corner of the table

c)

C. Highest costly cell of the table.

d)

D. Upper left-hand corner of the table.

22.

The given TP is an example for

a)

Unbalanced

b)

Optimal

c)

degenerate

d)

infeasible

23.

The given Transportation problems is an example for

a)

unbalanced

b)

feasible

c)

degenerate

d)

optimal

24.

Which of the following is not needed to use the transportation model

a)

the cost of shipping one unit from each origin to each destination

b)

the destination points and the demand per period at each

c)

the origin points and the capacity or supply per period at each

d)

degeneracy

25.

Which of the following is a method for improving an initial solution in a transportation problem?

a)

northwest-corner

b)

intuitive lowest-cost

c)

Vogel's Approximation

d)

Stepping stone method

26.

Below are the reason why you study OM EXCEPT___________.

a)

OM is one of three major functions (marketing, finance, and operations) of any organization

b)

we want to understand what operations managers do

c)

OM include performing market research, producing a marketing plan, as well as strategically overseeing advertising and promotion

d)

we want (and need) to know how goods and services are produced

27.

Which of the given answer is the characteristics of the services?

a)

often knowledge base

b)

production usually separate from consumption

c)

can be inventoried

d)

low customer interaction

28.

Which one is the best describe for forecast approach on qualitative method?

a)

Used when situation is stable and historical data exist.

b)

Used when situation is vague and little data exist.

c)

Involves mathematical techniques.

d)

Forecast on existing product and current technology.

29.

_____________________ involve managers from sales, marketing research, accounting and production. This managers assembles to discuss their opinion on what will happen to sales in future.

a)

Jury of Executive Opinion

b)

Delphi Method

c)

Sales Force Composite

d)

Market Survey

30.

______________ assumes demand in next period is the same as demand in most recent period.

a)

Moving average

b)

Weighted Moving Average

c)

Naive Approach

d)

Exponential Smoothing

31.

____________ each salesperson projects his or her sales then combined at district and national levels.

a)

Jury of Executive Opinion

b)

Delphi Method

c)

Sales Force Composite

d)

Market Survey

32.

All of the answer below is the characteristics of the goods EXCEPT __________________________.

a)

can be inventoried

b)

site of facility important to minimize production cost

c)

some aspects of quality measurable

d)

reselling unusual

33.

Below are the roles of operations manager EXCEPT _________.

a)

planning on capacity, locations, products & services,make or buy, layout and do projects scheduling

b)

develop an incentive plan, issuance of work orders & job assignment.

c)

manage the inventory, control the quality, costs and productivity

d)

produce financial reports and develop direct investment activities

34.

Operations management _________________.

a)

involve in obtain funds and tracks the finance performing

b)

is the set of activities that transforming inputs into outputs

c)

creates demand and get customers

d)

involve the management of employee from recruitment to retirement

35.

Which one is TRUE for the medium range forecast?

a)

New product planning, facility location, research and development

b)

Forecasts tend to be more accurate than longer-term forecasts

c)

Purchasing, job scheduling, workforce levels, job assignments, production levels

d)

Forecast on sales, production planning and budgeting.

36.

If there is no feasible region of a LPP, then the solution is called as______

a)

an optimum solution

b)

an unbounded solution

c)

feasible solution

d)

infeasible solution

37.

When the max value of Z occurs

at the point of infinity then the LPP is said to have

a)

an optimum solution

b)

an unbounded solution

c)

no solution

d)

infeasible solution

38.

A Feasible solution in LP means

a)

Variables that represent decisions

b)

Any set of values for variables

c)

A solution that satisfies all the constraints

d)

A solution that does not satisfy all the constraints

39.

A constraint of the type ≤ can be converted into an equation by adding a ______variable to the left side of the constraint

a)

Surplus

b)

Slack

c)

Artificial

d)

Decision

40.

When the LPP is said to have an alternative optima, it has

a)

one solution

b)

more than one solution

c)

an unbounded solution

d)

no solution

41.

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

a)

Standard Form

b)

Primal Form

c)

Canonical Form

d)

Dual Form

42.

We can solve a linear programming problem by simplex method if

a)

Number of constraints is less than the number of decision variables.

b)

Number of decision variables = Number of constraints

c)

There are any number of constraints and any number of decision variables

d)

Number of constraints is greater than number of decision variables

43.

A basic solution to the system is called __________if one or more of the variables vanish

a)

No feasible

b)

Degenerate

c)

Non- Degenerate

d)

Multiple optimal

44.

Decision variables are

a)

the known values of the model.

b)

the unknown that are to be determined by solving the model

c)

variables not under the control of the decision maker

d)

the variables that we introduce to bring it to standard form

45.

Graphical method can be used to solve linear programming problems with

a)

Two constraints

b)

Two variables only

c)

More than 2 variables

d)

More than 2 constraints

46.

Which of the following is not a property of all LPP

a)

Optimization of objective

b)

Computer programme

c)

Non negativity restrictions

d)

The presence of restrictions

47.

In standard form, all constraints are expressed as

a)

< =

b)

> =

c)

=

d)

48.

The same sequence of simplex iteration repeated endlessly without improving the solution is called

a)

Infeasible solution

b)

Cycling

c)

Unbounded solution

d)

No solution

49.

Simplex methods is a technique of solving

a)

Transportation problem

b)

Assignment problem

c)

Linear Programming Problem

d)

Inventory Problems

50.

A feasible solution, which is also basic is called

a)

Basic Solution

b)

Infeasible Solution

c)

Basic feasible solution

d)

unbounded solution

51.

The intersection of the pivot

column and pivot row is called

a)

non pivot element

b)

pivot element

c)

row element

d)

column element

52.

Simplex method can be used to solve linear programming problems with

a)

only three variables

b)

Two or More variables

c)

only 2 constraints

d)

Only three constraints

53.

The region which consists of all the points that satisfy all the constraints including the non – negativity restrictions is called

a)

Infeasible region

b)

Feasible Region

c)

Annulus region

d)

No Solution space

54.

A basic solution to the system is called __________if one or more of the variables vanish.

a)

No feasible

b)

Degenerate

c)

Non- Degenerate

d)

Multiple optimal

55.

Which of the following variable is subtracted from the left side of the constraint of the type “ \ge   ” to be converted to an equation?

a)

Slack

b)

Surplus

c)

Artificial

d)

Decision