Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 10

LINEAR

PROGRAMMING( B
ASIC
MAXIMIZATION )
AGENDA

• Introduction
• Steps to get started
• Demonstration Scenario
• Engaging the audience
• Visual aids
• Final tips & takeaways

2
INTRODUCTION

WHAT IS THE BASIC MAXIMIZATION MODEL ?


STEPS TO GET
STARTED ON THE
MAXIMIZATION
MODEL
Step 1: Identifying your Variables
Step 2: Formulating an objective Function
Step 3: Identifying your constraints
Step 4:Positioning your sign restrictions
DEMONSTRATION SCENARIO

Google manufactures two types of the Pixel phone, the regular Pixel*8
and the premium Pixel*8 Pro. Each model requires the use of two
operations, assembly and finishing, with at most 12 hours available for
each operation. The regular model requires 1 hour of assembly and 2
hours of finishing, while the *8 Pro gadget needs 2 hours of assembly
and 1 hour of finishing. Due to other restrictions, Google can make at
most 18 phones a day. If a profit of $200 is realized for each regular
gadget and $300 for a premium gadget, how many of each should be
manufactured to maximize profit?

5
STEP 1:

What are variables?

•Let the number of regular Pixel*8 manufactured each day = x

•Let the number of premium Pixel*8 Pro manufactured each day = y

6
STEP 2

1. What is an objective The objective function is


function?
Maximum z =200x + 300y

7
STEP 3 / 4

Since the regular phone requires 1 hour of assembly and the premium phone requires two hours of assembly, and
there are at most 12 hours available for this operation

x + 2y ≤ 12
The company can make at most 18 phones a day. This will be scripted as
x + y ≤ 18
The regular phone will requires two hours of finishing and the premium phone one hour. Again, there are at most
12 hours available for finishing. This gives us the following constraint.
2x + y ≤ 12
x≥0 and y≥0
8
Maximum z =200x + 300y
x + 2y ≤ 12
x + y ≤ 18
2x + y ≤ 12
x≥0;y≥0

9
THANK YOU

You might also like