Module 1

1.) Service mechanism in a queuing system is characterised by ______________.

- server's behaviour

2.) To proceed with the Modified Distribution method algorithm for solving a transportation
problem, the number of dummy allocations need to be added are______________.
- n-1

3.) The objective of network analysis is to______________.

- minimise total project duration

4.) The difference between total float and head event slack is ______________.
- free float

5.) 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 ______________.
- rows or columns

6.) A feasible solution to a linear programming problem:

- must satisfy all the constraints of the problem simultaneously.

7.) In program evaluation review technique network, each activity time assumes a beta distribution
because:
- it is a unimodal distribution that provides information regarding the uncertainty of time
estimates of activities.

8.) For any primal problem and its dual, ______________.

- primal will have an optimal solution if dual does too

9.) If any value in XB column of final simplex table is negative, then the solution is ______________.
- infeasible

10.)Operations research approach is ______________.

- multi-disciplinary

11.)Quantitative methods emphasise objective measurements and the statistical, mathematical, or

numerical analysis of data collected through polls, questionnaires and surveys, or by
manipulating pre-existing statistical data using computational techniques.
- True

12.)Operations research, often shortened to the initialism OR, is a discipline that deals with the
development and application of advanced analytical methods to improve decision-making.
 - True

13.)If there is no non-negative replacement ratio in solving a Linear Programming Problem, then the
solution is ______________.
- unbounded

14.)Decision making is the process of making choices by identifying a decision, gathering

information and assessing alternative resolutions.
- True

15.)Symbolic modelling is a therapeutic method that uses symbols, metaphors and modelling to
facilitate positive change.
- True

16.)Modelling is the essence of operations research. A model is an abstraction of idealised

representation of a real-life problem.
- True

17.)Analogical models are a method of representing a phenomenon of the world, often called the
"target system" by another, more understandable or analysable system.
- True

Module 2 – (30 Marks)

1) The linear function of the variables which is to be maximised or minimised is called

____________.
- Objective function

2) The first step in formulating a linear programming problem is:

- Identify and define the decision variables

3) A feasible solution to an LP problem:

- Must satisfy all of the problem's constraints simultaneously.

4) Linear programming of an LP problem is important because:

- It helps in converting the verbal description and numerical data into mathematical expression.

5) Non-negativity restriction in LPP indicates that:

- All decision variables must take on values equal to or greater than zero.
6) Constraints in LPP mean:
- Limitations are expressed in mathematical equalities (or inequalities)

7) In graphical method, the restriction on number of decision variables is __________.

- Two

8) Term ‘Linear’ in LPP symbolises that:

- Relationship among all variables is linear.

9) Which of the following is assumption of an LP model?

- All of these

10) Linear programming is a:

- All of these

11) Certainty means that the problem is assumed to have no probabilistic elements whatsoever.
This is technically never true in the real world; some degree of uncertainty is always present.
- True

12) In graphical method, the restriction on number of constraints is __________.

- None of these

13) Additivity is the combined effect of the decision variables in any one equation is the algebraic
sum of their individual weighted effects.
- True

14) Linear programming is a method to achieve the best outcome (such as maximum profit or
lowest cost) in a mathematical model whose requirements are represented by linear
relationships.
- True

15) Proportionality is the means that each decision variable in every equation must appear with a
constant coefficient i.e., the variable is multiplied by a number and nothing else.
- True

16) Model formulation is the step where our knowledge of a natural system is translated in
mathematical form.
- True

17) The simplex method is a systematic procedure for testing the vertices as possible solutions.
- True

Module 3 – (30 Marks)

1) Any change in the values for the RHS (Right Hand Side) of a binding constraint of an LP problem
will:
- not change the slope of the constraint but move it parallel to the original.

2) The case where there are alternate solutions or multiple optimal solutions is mostly identified in
solver when:
- when the Allowable Increase or Allowable Decrease column for the OFC of a variable has a zero
value in the Adjustable Cells Table.

3) Suppose that a MAX problem contained the following constraint: 5x + 8y ≤ 40. Then which of the
following statements is true?
- For the point (1, 4), the slack for this constraint would have a value of 3.

4) Let x = number of units of product 1 to produce, and let y = number of units of product 2 to
produce. Consider the following objective function: Maximise z = x + 2y. Subject to the following
constraints: x + y ≤ 12 (resource A), x ≤ 8 (resource B), y ≤ 6 (resource C), x and y ≥ 0. What will
be the optimal objective function value?
- 18

5) Which of the following statements is true?

- Increasing the RHS of a less than or equal to constraint will eventually make it redundant.

6) Which of the following statements is true?

- Changes to an objective function coefficient will not affect the size of the feasible region.

7) When there is a change in one of the coefficients of the objective function, and yet optimal
point remains as the optimal point after the change, then:
- the value of the new optimal objective function changes and is generally different from the
original one.

8) The report which shows the final values of the decision variables, the objective function, and the
formula, slack or surplus, status, and LHS value for each constraint is the:
- answer report.

9) Consider a scenario with an objective function: Minimise $14X + $17Y. Assume that the value of
X in the optimal solution is zero, and the reduced cost for variable X is $3. At what objective
function coefficient will X first become part of the optimal solution?
- 11

10) If a greater than or equal to constraint is used to model a minimum requirement constraint,
then:
- it will always be a binding constraint if the objective function is a MAX.
 11) A variable is a quantity that may change within the context of a mathematical problem or
experiment.
- True

12) Improving a minimisation LP problem means:

- decreasing the optimal objective function value

13) Sensitivity analysis is a financial model that determines how target variables are affected based
on changes in other variables known as input variables.
- True

14) Input-Output Coefficient is defined as the objective of making decisions.

- True

15) Constraint is something that imposes a limit or restriction or that prevents something from
occurring. An example of a constraint is the fact that there are so many hours in a day to
accomplish things.
- True

16) The term ‘dual’, in general, implies two or double. The concept of duality is very useful in
mathematics, physics, statistics, engineering, and managerial decision-making.
- True

17) The Dual Simplex Method will pivot from dual feasible dictionary to dual feasible dictionary
working towards feasibility.
- True

Module 4

1) When the total demand is equal to supply, then the transportation problem is said to be
______________
- balanced.

2) For finding an initial feasible solution in transportation problem, ____________ method is used.
- Least Cost Method

3) The transportation problem deals with the transportation of:

- several products from several sources to several destinations.

4) The solution to a transportation problem with ‘m’ rows (supplies) and ‘n’ columns (destination)
is basically feasible if number of positive allocations are:
 - m+n-1

5) For finding an optimum solution in transportation problem, ____________ method is used.

- MODI

6) In northwest corner method, first allocation is made at:

- Upper left-hand corner of the table.

7) The maximisation type of transportation problem can be converted into minimisation type:
- by subtracting the all the unit costs from the highest unit cost of the table.

8) In applying Vogel’s approximation method, row and column penalties are determined by:
- finding the difference between the two lowest unit costs in each row and column.

9) Transportation model is based on the assumption that any damage sustained while travelling
has negative repercussions, it is used to examine transportation networks and determine the
most effective path for resource allocation.
- True

10) The dummy source or destination in a transportation problem is added to ______________

- balance the transportation problem.

11) The Least Cost Method is another method used to obtain the initial feasible solution for the
transportation problem. Here, the allocation begins with the cell which has the minimum cost.
The lower cost cells are chosen over the higher-cost cells with the objective to have the least
cost of transportation.
- True

12) The North-West Corner Rule is a method adopted to compute the initial feasible solution of the
transportation problem. The name North-West Corner is given to this method because the basic
variables are selected from the extreme left corner.
- True

13) The Modified Distribution Method or MODI is an efficient method of checking the optimality of
the initial feasible solution
- True

14) The transportation model addresses the concept of moving a thing from one place to another
without change. It assumes that any damage enroute has negative consequences, and so it's
used to analyse transportation systems and find the most efficient route for resource allocation.
- True

15) Degeneracy is a term referring to the fact that two or more stationary states of the same
quantum-mechanical system may have the same energy even though their wave functions are
 not the same.
- True

16) Unbalanced transportation problem is a transportation problem where the total availability at
the origins is not equal to the total requirements at the destinations.
- True

17) The multiple optimal solutions arise in a linear programming problem with more than one set of
basic solutions that can minimise or maximise the required objective function. The multiple
optimal solutions are called the alternate basic solutions.
- True

Module 5

1) Maximisation assignment problem is transformed into a minimisation problem by:

- subtracting each entry in the table from the maximum value in that table.

2) The assignment problem is always a ______________matrix

- square

3) Dummy row or column is added in an assignment problem:

- To balance total activities and total resources

4) In an assignment problem:
- Only one activity be assigned to each resource.

5) The method used for solving an assignment problem is called _____________.

- Hungarian method

6) In marking assignments, which of the following should be preferred?

- Only row/column having single zero

7) ______ is based on the principle that if a constant is added to every element of a row and/or a
column of cost matrix, the optimum solution of the resulting assignment problem is the same as
the original problem and vice versa.
- The Hungarian Method

8) The assignment problem will have alternate solutions when:

- there is a tie between zero opportunity cost cells.
 9) An assignment problem is considered as a particular case of a __________________.
- Transportation problem

10) While solving an assignment problem, an activity is assigned to a resource with zero opportunity
cost because the objective is to ______
- minimise total cost of assignment.

11) ______ problem is an assignment problem where the number of facilities is not equal to the
number of jobs.
- Unbalanced Assignment Problem

12) _____ is standard technique in linear programming for solving an optimisation problem,
typically one involving a function and several constraints expressed as inequalities.
- Simplex method

13) ______ is one of the topics of operations research. It consists of assigning a specific task or job
to a specific person or worker assuming that there are the number of persons equal to the
number of tasks available.
- Assignment models

14) _____ is the forgone benefit that would have been derived from an option not chosen. To
properly evaluate opportunity costs, the costs and benefits of every option available must be
considered and weighed against the others.
- Opportunity Cost

15) An assignment problem is a type of transportation problem in which the resources (such as
facilities) are assignees, and the destinations (such as activities) are destinations (say jobs).
- True

16) An unbalanced assignment can be transformed into a balanced one.

- True

17) A travelling salesman problem differs from an assignment problem in that distinct destinations
are assigned to different sources in an assignment problem, whereas a destination is assigned to
a source in a travelling salesman problem.
- True

Check your understanding

1) Select the correct statement

a) EOQ is that quantity at which price paid by the buyer is minimum
b) If annual demand doubles with all other parameters remaining constant, the Economic Order
Quantity is doubled
c) Total ordering cost equals holding cost
 d) Stock out cost is never permitted

2) Service mechanism in a queuing system is characterized by

- servers behavior

3) Which of the following is NOT a characteristic of the LPP

- The problem must be of minimization type

4) In graphical method the restriction on number of decision variables is __________.

- Two

5) In graphical method the restriction on number of constraint is __________.

- None of these

6) Sensitivity Analysis generally assumes

- we are considering a change in only one input data value at a time.

7) Improving a minimization LP problem means:

- decreasing the optimal objective function value

8) In northwest corner method first allocation is made at

- Upper left-hand corner of the table.

9) One disadvantage of using North-West Corner rule to find initial solution to the transportation
problem is that
- It does not take into account cost of transportation

10) The maximization type of transportation problem can be converted into minimization type
________
- by subtracting the all the unit costs from the highest unit cost of the table.

11) In applying Vogel’s approximation method row and column penalties are determined by:
- finding the difference between the two lowest unit costs in each row and column

12) An assignment problem can be viewed as a special case of transportation problem in which the
capacity from each source is _______ and the demand at each destination is ________.
- one; one

13) Maximization assignment problem is transformed into a minimization problem

by______________.
- subtracting each entry in the table from the maximum value in that table