SlideShare a Scribd company logo
1 of 12
LP model Using
Excel & R
Product mix problem - Beaver Creek Pottery
Company
How many bowls and mugs should be
produced to maximize profits given labor and
materials constraints?
 Step 1: define decision variables
 Let x1=number of bowls to produce/day
 x2= number of mugs to produce/day
 Step 2: define the objective function
 maximize Z = $40x1 + 50x2
 where Z= profit per day
 Step 3: state all the resource constraints

 constraint 1) 1x1 + 2x2 <= 40 hours of labor ( resource
 constraint 2) 4x1 + 3x2 <= 120 pounds of clay
(resource
 Step 4: define non-negativity constraints
 x1>=0; x2 >= 0
 Complete Linear Programming Model:
 maximize Z=$40x1 + 50x2
 subject to
 1x1 + 2x2 <= 40
 4x2 + 3x2 <= 120
 x1, x2 >= 0
Maximize Z = $40x1 + $50x2
subject to:
1x1 + 2x2 <= 40
4x1 + 3x2 <=120
x1, x2 >= 0
Maximize Z = $100x1 + $50x2
subject to:
1x1 + 2x2 <= 40
4x1 + 3x2 <= 120
x1, x2 >= 0
Maximize Z = $40x1 + $100x2
subject to:
1x1 + 2x2 <= 40
4x1 + 3x2 <= 120
x1, x2 >= 0
Using R

More Related Content

Similar to Final presentation

Linear Programming_rereeLecture 2 (1).ppt
Linear Programming_rereeLecture 2 (1).pptLinear Programming_rereeLecture 2 (1).ppt
Linear Programming_rereeLecture 2 (1).pptRahulPandey785327
 
Linear Programming Free Power Point Slide Presentation.ppt
Linear Programming Free Power Point Slide Presentation.pptLinear Programming Free Power Point Slide Presentation.ppt
Linear Programming Free Power Point Slide Presentation.pptmarkgilvinson
 
Formulation Lpp
Formulation  LppFormulation  Lpp
Formulation LppSachin MK
 
Multiplying Binomials and Trinomials
Multiplying Binomials and Trinomials Multiplying Binomials and Trinomials
Multiplying Binomials and Trinomials 40560777
 
X factoring revised
X factoring revisedX factoring revised
X factoring revisedsgriffin01
 
Taylor introms10 ppt_02
Taylor introms10 ppt_02Taylor introms10 ppt_02
Taylor introms10 ppt_02QA Cmu
 
introduction to Operation Research
introduction to Operation Research introduction to Operation Research
introduction to Operation Research amanyosama12
 
Algebra 2 Section 3-4
Algebra 2 Section 3-4Algebra 2 Section 3-4
Algebra 2 Section 3-4Jimbo Lamb
 
LP Graphical Solution
LP Graphical SolutionLP Graphical Solution
LP Graphical Solutionunemployedmba
 
1.3 solving equations
1.3 solving equations1.3 solving equations
1.3 solving equationsmath260
 
March 25, 2015
March 25, 2015March 25, 2015
March 25, 2015khyps13
 
Introduction to Operations Research/ Management Science
Introduction to Operations Research/ Management Science Introduction to Operations Research/ Management Science
Introduction to Operations Research/ Management Science um1222
 
1.3 solving equations y
1.3 solving equations y1.3 solving equations y
1.3 solving equations ymath260
 
Solving quadratics with square roots
Solving quadratics with square rootsSolving quadratics with square roots
Solving quadratics with square rootsswartzje
 

Similar to Final presentation (20)

Linear Programming_rereeLecture 2 (1).ppt
Linear Programming_rereeLecture 2 (1).pptLinear Programming_rereeLecture 2 (1).ppt
Linear Programming_rereeLecture 2 (1).ppt
 
Linear Programming Free Power Point Slide Presentation.ppt
Linear Programming Free Power Point Slide Presentation.pptLinear Programming Free Power Point Slide Presentation.ppt
Linear Programming Free Power Point Slide Presentation.ppt
 
Formulation Lpp
Formulation  LppFormulation  Lpp
Formulation Lpp
 
Multiplying Binomials and Trinomials
Multiplying Binomials and Trinomials Multiplying Binomials and Trinomials
Multiplying Binomials and Trinomials
 
X factoring revised
X factoring revisedX factoring revised
X factoring revised
 
Taylor introms10 ppt_02
Taylor introms10 ppt_02Taylor introms10 ppt_02
Taylor introms10 ppt_02
 
introduction to Operation Research
introduction to Operation Research introduction to Operation Research
introduction to Operation Research
 
Intro week3 excel vba_114e
Intro week3 excel vba_114eIntro week3 excel vba_114e
Intro week3 excel vba_114e
 
Decision making
Decision makingDecision making
Decision making
 
Algebra 2 Section 3-4
Algebra 2 Section 3-4Algebra 2 Section 3-4
Algebra 2 Section 3-4
 
P
PP
P
 
LP Graphical Solution
LP Graphical SolutionLP Graphical Solution
LP Graphical Solution
 
LINEAR PROGRAMING
LINEAR PROGRAMINGLINEAR PROGRAMING
LINEAR PROGRAMING
 
Gr 11 equations
Gr 11   equationsGr 11   equations
Gr 11 equations
 
Lenier Equation
Lenier EquationLenier Equation
Lenier Equation
 
1.3 solving equations
1.3 solving equations1.3 solving equations
1.3 solving equations
 
March 25, 2015
March 25, 2015March 25, 2015
March 25, 2015
 
Introduction to Operations Research/ Management Science
Introduction to Operations Research/ Management Science Introduction to Operations Research/ Management Science
Introduction to Operations Research/ Management Science
 
1.3 solving equations y
1.3 solving equations y1.3 solving equations y
1.3 solving equations y
 
Solving quadratics with square roots
Solving quadratics with square rootsSolving quadratics with square roots
Solving quadratics with square roots
 

More from heba_ahmad

heba alsayed ahmad_Recomm_#
heba alsayed ahmad_Recomm_#heba alsayed ahmad_Recomm_#
heba alsayed ahmad_Recomm_#heba_ahmad
 
heba alsayed ahmad_Recomm_#2
heba alsayed ahmad_Recomm_#2heba alsayed ahmad_Recomm_#2
heba alsayed ahmad_Recomm_#2heba_ahmad
 
bassel alkhatib recommendation
bassel alkhatib recommendation bassel alkhatib recommendation
bassel alkhatib recommendation heba_ahmad
 
recommendation dr jose
recommendation dr joserecommendation dr jose
recommendation dr joseheba_ahmad
 
recommendation dr.miguel
recommendation dr.miguelrecommendation dr.miguel
recommendation dr.miguelheba_ahmad
 
metaheuristic tabu pso
metaheuristic tabu psometaheuristic tabu pso
metaheuristic tabu psoheba_ahmad
 
Line uo,please
Line uo,pleaseLine uo,please
Line uo,pleaseheba_ahmad
 
Introduction to data science intro,ch(1,2,3)
Introduction to data science intro,ch(1,2,3)Introduction to data science intro,ch(1,2,3)
Introduction to data science intro,ch(1,2,3)heba_ahmad
 
&Final presentation
 &Final presentation &Final presentation
&Final presentationheba_ahmad
 

More from heba_ahmad (13)

heba alsayed ahmad_Recomm_#
heba alsayed ahmad_Recomm_#heba alsayed ahmad_Recomm_#
heba alsayed ahmad_Recomm_#
 
heba alsayed ahmad_Recomm_#2
heba alsayed ahmad_Recomm_#2heba alsayed ahmad_Recomm_#2
heba alsayed ahmad_Recomm_#2
 
bassel alkhatib recommendation
bassel alkhatib recommendation bassel alkhatib recommendation
bassel alkhatib recommendation
 
recommendation dr jose
recommendation dr joserecommendation dr jose
recommendation dr jose
 
recommendation dr.miguel
recommendation dr.miguelrecommendation dr.miguel
recommendation dr.miguel
 
metaheuristic tabu pso
metaheuristic tabu psometaheuristic tabu pso
metaheuristic tabu pso
 
Line uo,please
Line uo,pleaseLine uo,please
Line uo,please
 
Data mining
Data miningData mining
Data mining
 
Introduction to data science intro,ch(1,2,3)
Introduction to data science intro,ch(1,2,3)Introduction to data science intro,ch(1,2,3)
Introduction to data science intro,ch(1,2,3)
 
Shiny in R
Shiny in RShiny in R
Shiny in R
 
&Final presentation
 &Final presentation &Final presentation
&Final presentation
 
Chapter 18,19
Chapter 18,19Chapter 18,19
Chapter 18,19
 
Ggplot2 ch2
Ggplot2 ch2Ggplot2 ch2
Ggplot2 ch2
 

Final presentation

  • 2. Product mix problem - Beaver Creek Pottery Company How many bowls and mugs should be produced to maximize profits given labor and materials constraints?
  • 3.  Step 1: define decision variables  Let x1=number of bowls to produce/day  x2= number of mugs to produce/day  Step 2: define the objective function  maximize Z = $40x1 + 50x2  where Z= profit per day  Step 3: state all the resource constraints   constraint 1) 1x1 + 2x2 <= 40 hours of labor ( resource  constraint 2) 4x1 + 3x2 <= 120 pounds of clay (resource  Step 4: define non-negativity constraints  x1>=0; x2 >= 0  Complete Linear Programming Model:  maximize Z=$40x1 + 50x2  subject to  1x1 + 2x2 <= 40  4x2 + 3x2 <= 120  x1, x2 >= 0
  • 4. Maximize Z = $40x1 + $50x2 subject to: 1x1 + 2x2 <= 40 4x1 + 3x2 <=120 x1, x2 >= 0
  • 5. Maximize Z = $100x1 + $50x2 subject to: 1x1 + 2x2 <= 40 4x1 + 3x2 <= 120 x1, x2 >= 0
  • 6. Maximize Z = $40x1 + $100x2 subject to: 1x1 + 2x2 <= 40 4x1 + 3x2 <= 120 x1, x2 >= 0
  • 7.
  • 8.
  • 9.
  • 10.
  • 11.