Operation Research Ans

Operation research
MBA sem 2
Q1. By OR we can easily find the best possible solution of any
problem.There are many scope of application of OR in various fields of
everyday life.
In Defence Operation: In modern warfare techniques require

expertise knowledge in every fields.Each component works to drive
maximum gains from its operations.and there is always a possibility
that the strategy beneficial to one component may be unfeasible for
another component.Thus in defence operations, there is a requirment
to co-ordinate the activities of various components,which gives
maximum benefit to the organisation .A team of scientists from various
disciplines come together to study the strategies of different
components .After appropriate analysis of the various courses of
actions, the team selects the best course of action, known as “
optimum strategy”.
In Industry: Today business environment is always changing .There is

always need to check the validity of decisions continuously against the
situations .The industrial revolutions with increased division of labour
and introduction of management responsibilities has made each
component an independent unit having their own goals.The application
of OR helps in overcoming the difficulty by integrating the diversified
activites of various component to serve the interest of the
organization as a whole efficiently.
Planning: In modern times , it has become necessary for every govt.
to have careful planning ,for economic development of the country
.OR techniques can be used to maximize the per capita income, with
minimum sacrifice and time.
Agriculture: With increase in population ,there is a need to increase

agriculture output. But this cannot be done arbitrarily .There are
several restrictions .Hence the need to determine a course of action
serving the best under the given restrictions.We can solve this problem
by applying OR techniques.
In Hospitals:OR methods can solve waiting problems in out-patient

department of big hospitals and administrative problems of the
hospital organisation.
Also we can use OR in Transport ,Research and development etc area.
Q2. L.P.P is a mathematical technique designed to help manegers in

their planning and decision making.It is usually used in an organisation
that is trying to make most effective use of its resources.
The requirments of L.P.P are
*Decision variables and relationship
*Well defined objective funtion
*Existence of alternative courses of

action.
*Non-negative conditions on
decision variables.
Basic Assumptions of L.P.P- 1.Linearity
2.Deterministic
3.Additively
4.Divisibility
Q3. Different steps to solve problem by Simplex Method:
1. Introduce stack variables (Si’s) for “≤” type of constraint.

2. Introduce surplus variables (Si’s) and artificial variables (Ai) for “≤”
type of constraint.
3. Introduce only Artificial variable for “=” type of constraint.
4. Cost (Cj) of slack and surplus variables will be zero and that of
artificial variable will be “M”
5. Find Zj - Cj for each variable.
6. Slack and artificial variables will form basic variable for the first
simplex table. Surplus variable will never become basic variable for the
first simplex table.
7. Zj = sum of [cost of variable x its coefficients in the constraints –
Profit or cost coefficient of the variable].
8. Select the most negative value of Zj - Cj. That column is called key
column. The variable corresponding to the column will become basic
variable for the next table.
9. Divide the quantities by the corresponding values of the key column
to get ratios; select the minimum ratio. This becomes the key row. The
basic variable corresponding to this row will be replaced by the
10. The element that lies both on key column and key row is called
Pivotal element.
11. Ratios with negative and “α” value are not considered for
determining key row.
12. Once an artificial variable is removed as basic variable, its column
will be deleted from next iteration.
13. For maximization problems, decision variables coefficient will be
same as in the objective function. For minimization problems, decision
variables coefficients will have opposite signs as compared to objective
function.
14. Values of artificial variables will always is – M for both maximization
and minimization problems.

15. The process is continued till all Zj - Cj ≥ 0
Q4.The importance of duality concept are –
The interpretation of the dual variable from the loss or economic

point of view proves extremely useful in programming future decisions
in the activities.
If the primal contains a large number of constraints and a smaller

number of variables ,the labour of computation can be considerably
reduced by converting it into the dual problem and then solve it.
Q5.Matrix Minimum method:

Step 1: Determine the smallest cost in the cost matrix of the
transportation table .Let it be cij. Allocate xij=min(ai,bj)in the cell(I,J)
Step 2: If xij=ai cross the ith row of the transportation table,decrease bj

by ai and proceed step 3.
If xij=bj cross the ith column of the transportation table, decrease a by b

and proceed step 3.
If xij=ai=bj cross either the ith row or ith column , but not both.
Step 3: Repeat step 1 and 2 to reduce transportation table until all the
rim requirements are satisfied .Whenever the minimum cost is not
unique, make an arbitrary choice among the minima.
Q6. I.P.P : Integer programming problem is a special case of L.P.P,

where all or some variables are constrained to assume non-negetive
integer values.
All I.P.P method:
Step 1: Convert the minimization IPP into maximization, if it is in

minimization form. Ignore the integrality condition
Step 2: Introduce the slack or surplus variables, if needed to convert

the inequations into equations and obtain the optimum solution of the
given LPP by using simplex algorithm.
Step 3: Test the integrality of the optimum solution
a) If the optimum solution contains all integer values, an optimum basic
feasible integer solution has been obtained.
b) If the optimum solution does not include all integer values, then
proceed to the next step.
Step 4: Examine the constraint equations corresponding to the current
optimum solution. Let these equations be represented by
∑ yij, xj =bi(i=0,1,2,3…..m)
Where n denotes the number of variables and m the number of
equations. Choose the largest fraction of bis to find max {bi}i
Let it be [bk1] or write is as fko
Step 5: Express the negative fractions if any, in the kth row of the
optimum simplex table as the sum of a negative integer and a non-
negative fraction.
n
Step 6: Find the Gomorian constraint ∑ f (kj) , xj ≥fk

j=0
And add the equation

n1
Gsla (1)= -fko + ∑ f ( kj) . x j

j=0
To the current set of equation constraints

Step 7: Start with a new set of equation constraints. Find the new
optimum solution by dual simplex algorithm so that G sla (1) is the initial
leaving basic variable.
Step 8: If the new optimum solution for the modified LPP is an integer
solution, it is also feasible and optimum for the given IPP. If it is not an
integer solution, then return to step 4 and repeat the process until an
optimum feasible integer solution is obtained

Operation Research Ans

Uploaded by

Copyright:

Available Formats

Operation Research Ans

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Operation Research Ans

Uploaded by

Copyright:

Available Formats

Operation research

In Defence Operation: In modern warfare techniques require

In Industry: Today business environment is always changing .There is

Agriculture: With increase in population ,there is a need to increase

In Hospitals:OR methods can solve waiting problems in out-patient

Also we can use OR in Transport ,Research and development etc area.

Q2. L.P.P is a mathematical technique designed to help manegers in

The requirments of L.P.P are

*Decision variables and relationship

*Well defined objective funtion

*Existence of alternative courses of

Q3. Different steps to solve problem by Simplex Method:

1. Introduce stack variables (Si’s) for “≤” type of constraint.

and minimization problems.

Q4.The importance of duality concept are –

The interpretation of the dual variable from the loss or economic

If the primal contains a large number of constraints and a smaller

Q5.Matrix Minimum method:

Step 2: If xij=ai cross the ith row of the transportation table,decrease bj

If xij=bj cross the ith column of the transportation table, decrease a by b

Q6. I.P.P : Integer programming problem is a special case of L.P.P,

All I.P.P method:

Step 1: Convert the minimization IPP into maximization, if it is in

Step 2: Introduce the slack or surplus variables, if needed to convert

Step 6: Find the Gomorian constraint ∑ f (kj) , xj ≥fk

And add the equation

Gsla (1)= -fko + ∑ f ( kj) . x j

To the current set of equation constraints

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.