Scribd
Upload
8 views

OR5

operation research papers

Uploaded by

Blacky Blue
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views

OR5

operation research papers

Uploaded by

Blacky Blue
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Question2

Question3
Question4
i. Name of various method to solve LPP

Linear Programming Problems (LPPs) are typically solved using various methods, each suited to different
problem sizes, complexities, and requirements. Here are some common methods used to solve LPPs:

1. Graphical Method: This method is applicable when dealing with two decision variables and when the
constraints and the objective function can be represented graphically. The feasible region is plotted, and
the optimal solution is determined by identifying the corner points of the feasible region.

2. Simplex Method: The simplex method is one of the most widely used algorithms for solving LPPs. It's
an iterative process that starts at a feasible solution and moves along the edges of the feasible region
until an optimal solution is reached. It's particularly efficient for problems with a larger number of
decision variables.

3. Dual Simplex Method: This is an extension of the simplex method and is used specifically for solving
LPPs with dual problems. It's advantageous when the primal problem is infeasible or unbounded, or
when the dual problem has a better starting feasible solution.

4. Interior Point Method: This method involves starting from an interior point of the feasible region and
iteratively moving towards the optimal solution while staying within the feasible region. It's particularly
effective for large-scale linear programming problems.

5. Branch and Bound Method: This is an algorithmic technique that systematically divides the feasible
region into smaller subspaces (branches) and evaluates the objective function in each branch. It's often
used for solving mixed-integer linear programming (MILP) problems where some variables are restricted
to be integers.

6. Cutting Plane Method: In this method, additional constraints (cuts) are iteratively added to the
problem to refine the feasible region and improve the solution until an optimal solution is obtained. It's
often used in solving integer linear programming (ILP) problems.

7. Network Flow Algorithms: Certain types of linear programming problems, such as transportation and
assignment problems, can be solved using specialized algorithms like the transportation simplex
method, Hungarian algorithm, or network simplex method.
8. Ellipsoid Method: This method involves enclosing the feasible region within an ellipsoid and
iteratively shrinking the ellipsoid towards the optimal solution. It's primarily used in theoretical analysis
and has limited practical application due to its computational complexity.

9. Barrier Method: This method involves transforming the linear programming problem into a sequence
of barrier problems, which are then solved using interior point methods. It's particularly useful for
solving large-scale convex optimization problems.

The choice of method depends on factors such as problem size, complexity, constraints, and the specific
requirements of the problem at hand. Each method has its advantages and disadvantages, and
practitioners often select the most appropriate method based on these considerations.

ii. Difference between basic and non basic variable

iii. Phases and processes of operational research

Following are the six phases and processes of operational research:

1. Formulate the problem: This is the most important process, it is generally


lengthy and time consuming. The activities that constitute this step are visits,
observations, research, etc. With the help of such activities, the O.R. scientist
gets sufficient information and support to proceed and is better prepared to
formulate the problem.

This process starts with understanding of the organizational climate, its


objectives and expectations. Further, the alternative courses of action are
discovered in this step.
2. Develop a model: Once a problem is formulated, the next step is to express
the problem into a mathematical model that represents systems, processes or
environment in the form of equations, relationships or formulas. We have to
identify both the static and dynamic structural elements, and device
mathematical formulas to represent the interrelationships among elements.
The proposed model may be field tested and modified in order to work under
stated environmental constraints. A model may also be modified if the
management is not satisfied with the answer that it gives.

3. Select appropriate data input: Garbage in and garbage out is a famous


saying. No model will work appropriately if data input is not appropriate. The
purpose of this step is to have sufficient input to operate and test the model.

"Data quality is the difference between a data warehouse and a data garbage dump." -
Jarrett Rosenberg

4. Solution of the model: After selecting the appropriate data input, the next
step is to find a solution. If the model is not behaving properly, then updating
and modification is considered at this stage.

5. Validation of the model: A model is said to be valid if it can provide a


reliable prediction of the system’s performance. A model must be applicable
for a longer time and can be updated from time to time taking into
consideration the past, present and future aspects of the problem.

6. Implement the solution: The implementation of the solution involves so


many behavioural issues and the implementing authority is responsible for
resolving these issues. The gap between one who provides a solution and
one who wishes to use it should be eliminated. To achieve this, O.R. scientist
as well as management should play a positive role. A properly implemented
solution obtained through O.R. techniques results in improved working and
wins the management support.

You might also like