Scribd
Upload
808 views5 pages

Operation Research Lab Manual - Lab 03

The document is a lab manual for an operational research class. It provides instructions on using the corner point method to find the optimal solution to linear programming problems with two decision variables. It gives an example of using the Tora software to solve a sample linear programming problem about determining production levels to maximize profit for a company making two products given costs, profits, demand and budget constraints. Students are assigned the task of using Tora to find the optimal solution for another sample problem about determining production levels to maximize profits for a chocolatier making two types of chocolates given similar constraints.

Uploaded by

Atif Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
808 views5 pages

Operation Research Lab Manual - Lab 03

The document is a lab manual for an operational research class. It provides instructions on using the corner point method to find the optimal solution to linear programming problems with two decision variables. It gives an example of using the Tora software to solve a sample linear programming problem about determining production levels to maximize profit for a company making two products given costs, profits, demand and budget constraints. Students are assigned the task of using Tora to find the optimal solution for another sample problem about determining production levels to maximize profits for a chocolatier making two types of chocolates given similar constraints.

Uploaded by

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

National University of Modern Languages

(NUML)
Rawalpindi Campus
Department of Engineering and Computer Sciences

Operation Research

Lab. Manual

Prepared by:

Engr. Mazahir Hussain


[email protected]

Operational Research Lab Manual Page 1


Lab Experiment No. 3

CORNER POINT METHOD TO FIND OPTIMAL SOLUTION OF LINEAR


PROGRAMMING PROBLEMS (LPP)

is applicable to solve the LPP involving two decision variables x1, and x2, we usually take these
decision variables as x, y instead of x1, x2. To solve an LPP, the graphical method includes two
major steps.

i. The determination of the solution space that defines the feasible solution (Note that the
set of values of the variable x1, x2, x3,....xn which satisfy all the constraints and also the
non-negative conditions is called the feasible solution of the LPP).
ii. The determination of the optimal solution from the feasible region.
iii. There are two techniques to find the optimal solution of an LPP. Corner Point Method
and ISO- PROFIT (OR ISO-COST).

Some Exceptional Cases

We may come across LPP which may have no feasible (infeasible) solution or may have
unbounded solution. If the intersection of the constraints is empty and the problem has no
feasible solution. Therefore the given L.P.P has no solution.

CONCLUSIONS:
The graphical method of solving an LPP is possible only if there are two decision variables (say
x and y). This method is not suitable if there are three or more decision variables. In this case,
there is a powerful method called 'simplex method'. The wide usage of liner programming helps
in business and economics, to use the resources available in a planned and economical way. We
have just learnt the basics of LPP; there is in fact a lot to learn. A lot of research work is carried
all over the world which is based on LPP.
There are a few limitations of linear programming

i. Linear programming is applicable only to problems where the constraints and objective
function are linear i.e., where they can be expressed as equations which represent straight

Operational Research Lab Manual Page 2


lines. In real life situations, when constraints or objective functions are not linear, this
technique cannot be used.
ii. Factors such as uncertainty, weather conditions etc. are not taken into consideration.

Example:
A company manufactures and sells two (2) types of products: ‘A’ and ‘B’.
The cost of the product for each unit of ‘A’ and ‘B’ is $200 and $150 respectively.
Each unit of ‘A’ yields a profit of $20 and each unit of ‘B’ yields a profit of $15 on selling.
Company estimates the monthly demand of ‘A’ and ‘B’ to be maximum of 500 units in all.
The production budget for month is set at $ 50,000. How many units should be the company
manufacture in order to earn maximum profit from its monthly sales of ‘A’ and ‘B’.

Tabular form:

Products Cost of Profit per unit Total demand


Production per
unit
A $200 $20 500 units
B $150 $15
Production budget $50,000 -- --

Solution:
1- Assume that X1 = A & X2 = B

2- Objective Function:

Maximize Profit: Z= 20 X1 + 15 X2

3- Constraints:

200X1 + 150X2 ≤ 50,000 --- 1 (budget)


X1 + X2 ≤ 500 --- 2 (demand)

4- Applying Non-Negativity Restrictions


X1 ≥ 0
X2 ≥ 0

Operational Research Lab Manual Page 3


Solution Steps by using Tora:
Open Tora Software
Click on “Click Here” as shown below.

Then click on “Linear Programming”


Set values of Decimal notation as per your requirement as shown below and click “Go to Input
Screen ”

Set “Problem Title”, “No of variables” and “No. of Constraints” as per your requirement and
press “Enter”
As per data of Example 1,we have to Enter following values in Tora as shown below:

Operational Research Lab Manual Page 4


After putting values, click on “Solve menu” and “Save the Data”.
Further click on “Solve Problem” and select “Graphical”
Click on “Go to Output Screen”
Click on “Click here to graph LP in one stroke”.
It will calculate and give you optimal Solution!

Lab Task: Find Optimal Solution of the following problem using Tora and prepare a lab report
on it!
Problem:
A boutique chocolatier has two products:
• Its flagship assortment of triangular chocolates, called Pyramide,
• and the more decadent and deluxe Pyramide Nuit.
How much of each should it produce to maximize profits?
• Every box of Pyramide has a a profit of $1.
• Every box of Nuit has a profit of $6.
• The daily demand is limited to at most 200 boxes of Pyramide and 300 boxes of Nuit.
• The current workforce can produce a total of at most 400 boxes of chocolate per day.

Operational Research Lab Manual Page 5

You might also like