Scribd
Upload
12 views11 pages

L OR Assignment

The document contains a group assignment for a course on operations research. It includes two questions to solve using linear programming and the simplex method. For question one, the students are asked to formulate an LP model to minimize the cost of producing a soft drink given ingredient constraints. For question two, the students must solve an LP model to maximize profits given several constraints and interpret the results.

Uploaded by

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

L OR Assignment

The document contains a group assignment for a course on operations research. It includes two questions to solve using linear programming and the simplex method. For question one, the students are asked to formulate an LP model to minimize the cost of producing a soft drink given ingredient constraints. For question two, the students must solve an LP model to maximize profits given several constraints and interpret the results.

Uploaded by

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

HAWASSA UNIVERSITY

AWADA BUSINESS AND ECONOMICS COLLEGE


DEPARTMENT OF ACCOUNTING AND FINANCE
GROUP ASSIGNMENT
COURSE TITTLE: Operation Research

NAME ID NO
2. EMEBET HAILU.........................................................................0265/13
2. EPHREM SILESHI.....................................................................0273/13
3. ESUBALEW TILAHUN...............................................................0288/13
4. FEYISO GEMEDI........................................................................0311/13
5. FIRAOL MOSISA........................................................................0319/13
6. GETE ESKEZYA..........................................................................0355/13
7. HUNDAOL GELAN.....................................................................0415/13
8. KEYREDIN HUSEN.....................................................................0448/13
9. KONJIT KISO..............................................................................0459/13
10. MLKAMU AEMIRO...................................................................0523/13

Submission date: Oct 2023


HAWASSA, ETHIOPIA
X1 X2 ≤ ≥

A1 A2

S1 S2

M1 M2
Q1.Bevco manufactures an orange flavored soft drink called Oranj by combining
orange soda and orange juice.Each ounce of orange soda contains 5 oz of sugar and
10mg of vitamin C.Each ounce of orange juice contains 3 oz of sugar and 20mg of
vitamin C.It costs Bevco $2 to produce an ounce of orange soda and $3 to produce an
ounce of orange juice.Marketing department has decided that each 10 oz bottle of
Oranj must contain at least 200mg of vitamin C and at most 40 oz of sugar.Use
simplex method to determine how Bevco can meet marketing dept.’s requirements
at minimum cost.(Show all necessary steps)

Based on the above information: ≤ ≥


a.Formulate linear programming model.(5pts)
b.Solve it using simplex solution method.(5pts)
c.Calculate range of feasibility and range of optimality and interpret the result.(5pts)

SOLUTION
A.FORMULATE LINEAR PROGRAMMING MODEL.(5PTS)

Let X1=be the number of ounces of orange soda used to make a 10 oz bottle of Oranj
and
X2 =be the number of ounces of orange juice used to make a 10 oz bottle of Oranj.

➡The objective is to minimize the cost of producing a 10 oz bottle of Oranj, which is


given by:
Min Z=2x1+3X2

The constraints are:

➡The amount of vitamin C in a 10 oz bottle of Oranj must be at least 200mg:

=10X1+20X2

➡The amount of sugar in a 10 oz bottle of Oranj must be at most 40 oz:


=5x1 + 3x2 ≤ 40

Mini Z=2x1+3x2
Subject to:
5X1+ 3X2≤40 ➡Suger constraint
10X1+20X2≥200 ➡Vitamin C constraint
X1 &X2≥0
B.SOLVE IT USING SIMPLEX SOLUTION METHOD.
(5PTS)

Step1:Standardizing the problem/model4

Mini Z=2x1+3x2+0s1+os2+A2
Subject to:
5X1+ 3X2+S1=40
10X1+20X2-S2+A2=200
X1, X2,S1,s2 and A1=0

Step2:Initial feasible solution


4
First tableau
Cj
Basic V X1 X2 S1 M Quantity

Zj
Cj-Zj

Second tableau

4
Cj
Basic V X X S S
Zj
Cj-Zj

c.Calculate range of feasibility and range of optimality and interpret the result.(5pts)

Q2.Maximize 30x1+40x2
Subject to:3x1+2x2≤600
3x1+5x2≤800
5x1+6x2≤1100
x1≥0,x2≥0

Based on the above information (show all necessary steps)


A)Solve it using simplex method and interpret the result.(5pts)
B)Calculate range of feasibility and range of optimality
and(5pts)
C)Find dual LP equation(5pts)

SOLUTION
A)Solve it using simplex method and interpret the result.(5pts)

Step 1. FORMULATE LINEAR PROGRAMMING


MODEL

Max Z= 30x1+40x2
Subject to:
3x1+2x2≤600
3x1+5x2≤800
5x1+6x2≤1100
X1≥0,X2≥0

STEP2: STANDARDIZE THE PROBLEM


MAX Z=30X1+40X2+OS1+OS2+OS3
Subject to:
3x1+2x2+S1=600
3x1+5x2+S2=800
5x1+6x2+S3=1100
X1,X2,S1,S2&S3=0

STEP 3: OBTAIN THE INITIAL SIMPLEX TABLEAU


First tebleau

C 30 40 0 0 0
Basic v X1 X2 S1 S2 S3 Q
S1 0 3 2 1 0 0 600
S2 0 3 5 0 1 0 800
S3 0 5 6 0 0 1 1100
Z 0 0 0 0 0 0
C-Z 30 40 0 0 0
Step4:Choose the“incoming”or“entering”variables and
➡The
enteringvariableisthevariablethathasthemost(thelargest)posi
tivevaluein

theC-Zrow (indicatorrow).

➡Itisthevariablethathasthehighestcontributiontoprofitper
unit.

X2 in ours case is the entering variable.


(Becausethemaximumnumberinthec-zrow

is40)

The
columnassociatedwiththeenteringvariableiscalledkeyorpivot
column8
8Step5:Choose the“leaving“or“outgoing”variable and
they
“pivot element”

Theleavingvariableisthevariablethathasthesmallestreplacem
entratio.

 S2 inourcaseistheleavingvariable.(Because the smallest


replacement ratio is160

Step 6: Perform rowoperations.9


91/5R2,
Second tableau
Cj 30 40 0 0 0
Basic V X1 X2 S1 S2 S3 Q
S1 0 3 2 1 0 0 600

X2 40 3/5 1 0 1/5 0 160

S3 0 5 6 0 0 1 1100

Zj
Cj-Zj

3RD TEBLEAU
Cj Q
Basic V
Zj
Cj-Zj

STEP4: CHOOSE
THE“INCOMING”OR“ENTERING”VARIABLES
STEP 5: CHOOSE
THE“LEAVING“OR“OUTGOING”VARIABLE AND
THE “PIVOT ELEMENT”

STEP 6: PERFORM ROW OPERATIONS

B)Calculate range of feasibility and range of optimality


and(5pts)

C)Find dual LP equation(5pts)

You might also like