Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
16 views

MathProgram Tutorial

Uploaded by

jingxihuang076
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

MathProgram Tutorial

Uploaded by

jingxihuang076
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Welcome!

This assignment is designed to test your problem-solving skills and critical-thinking


Instructions are provided for each question, but for many of the problems you must th
what the best solution would be.

The red boxes are marked because they either need a formula, or they are the values th
changing in solver. It will be up to you to determine what is the best variable to change.
to the layout of each problem, and understand the formulas already in place before yo
solve the problem. The red boxes that ask for the objective, variables, and constraints M
out. You can fill these out with a statement or a mathematical expression: "The numb
produced must be less than or equal to demand" or "Donuts produced <= Demand." P
taken off if these sections are not complete.

YOU MUST DO THIS ASSIGNMENT IN MICROSOFT WINDOWS. ONE OF THE


WILL NOT SOLVE IN EXCEL FOR MAC. USE ONLY simplexLP.
Good Luck!
skills and critical-thinking abilities.
the problems you must think through
d be.

, or they are the values that you will be


e best variable to change. Pay attention
already in place before you attempt to
riables, and constraints MUST be filled
al expression: "The number of Donuts
produced <= Demand." Points will be
complete.

NDOWS. ONE OF THE PROBLEMS


USE ONLY simplexLP.
Burritos

Burritos
Steak Chicken Veggie Mega What is the optimal number of each
How many should I make? 1 1 1 1 burrito to make? We don't want to e
demand because we would not be a
Demand 100 100 50 150 sell the extra. We want to maximize
We also cannot use more ingredient
Burritos we have available.
Ingredients Steak Chicken Veggie Mega
Beans 1 1 1 1
Rice 1 1 1 1 What is the objective?
Chicken 0 2 0 1
Steak 2 0 0 1 What can change to achieve the obje
Veggies 1 1 2 1
What are the constraints?

Materials Cost Used Available


Beans $ 0.50 4 300
Rice $ 0.35 4 400
Chicken $ 0.75 3 300
Steak $ 0.80 3 200
Veggies $ 0.70 5 500

Profitability Steak Chicken Veggie Mega


Price/Burrito $ 7.95 $ 7.95 $ 6.95 $ 8.95
Cost/Burrito $ 3.15 $ 3.05 $ 2.25 $ 3.10
Profit/Burrito $ 4.80 $ 4.90 $ 4.70 $ 5.85

Total Profit $ -
he optimal number of each type of
o make? We don't want to exceed
because we would not be able to
extra. We want to maximize profit.
cannot use more ingredients than
we have available.

he objective?

change to achieve the objective?

the constraints?
labor ounces of Johan the jeweler makes diamo
hours per diamonds Minimum and earrings. He wants to work
Made Unit profit unit per unit Demand month. He has 800 ounces of di
time, and ounces of diamonds r
40.00 Bracelet $ 300.00 0.35 1.2 75
product are given. If demand for
20.00 Necklace $ 200.00 0.15 0.75 50 beyond the minimum, how can J
30.00 Earrings $ 100.00 0.05 0.5 100 Finish the model by completing t

Profit What is the objective?

What can change to achieve the o


Labor Used Labor Available
<= 160 What are the constraints?

Diamonds Used Diamonds Available


<= 800
he jeweler makes diamond bracelets, necklaces,
rrings. He wants to work at most 160 hours per
He has 800 ounces of diamonds. The profit, labor
d ounces of diamonds required to produce each
are given. If demand for each product is unlimited
he minimum, how can Jason maximize his profit?
e model by completing the cells with red borders.

he objective?

change to achieve the objective?

the constraints?
Potato Chips Production

Flavor Regular BBQ Baked Cheese Wavy


Bags Produced 50 50 50 50 50
We want to make as much mon
producing as many chips as we
Labor/Bag 3 4 7 5 3.3
exceeding our labor and materi
Raw Material/Bag 3.2 3.4 3 4.8 3.3 be sure to not exceed max dem
Unit price $ 2.25 $ 2.50 $ 3.50 $ 2.75 $ 2.50 a perishable good, but we mus
Variable cost $ 1.00 $ 1.30 $ 2.25 $ 1.40 $ 1.20 demand to keep customers hap
calculated by multiplying the ne
Min Demand 100 25 25 15 20
type of bag produced.
Max Demand 200 100 60 80 80
Unit profit What is the objective?

Profit $ - What can change to achieve th

Used Available What are the constraints?


Labor <= 1000
Raw Material <= 1250
want to make as much money as possible by
ucing as many chips as we can without
eding our labor and materials. We want to
ure to not exceed max demand as chips are
ishable good, but we must meet minimum
and to keep customers happy. Unit profit is
lated by multiplying the net unit profit by the
of bag produced.

t is the objective?

t can change to achieve the objective?

t are the constraints?


5 Points
#ofQuestions Min Possible Max Possible Point Allocations
Multiple Choice 25 5 8 0
True False 15 5 8 0
Calculation 15 7 10 0
VBA 5 12 15 0

Total Points

We want to set the total points for the final exam to exactly 500. We
have a certain number of questions already made, but we haven't
decided on point allocations. We need to change the point allocations to
arrive at the 500 points. The allocations must be between the minimum
and maximum suggestions. Calc questions must be worth at least 2
more points than T/F and Mult. VBA questions must be worth at least 5
more points than Calc. All allocations must be whole numbers.

What is the objective?

What can change to achieve the objective?

What are the constraints?

You might also like