ACTIVITIES in Management Science
ACTIVITIES in Management Science
➔ MAXIMIZATION:
● Profit Maximization - Linear programming can help with
selecting the best levels of production and sales for various
products in order to maximize total earning while taking
production capacity and market demand into account.
● Portfolio Optimization - Linear programming can be used to
create optimal investment portfolios by considering factors like
risk profiles, expected returns, and diversification constraints.
● Customer Satisfaction Maximization - Linear programming can
be used to optimize service schedules, staffing levels, and
resource allocation to maximize customer satisfaction while
considering operational constraints.
● Capacity Utilization - It helps in determining an optimal
schedule of production for various products in order to maximize
utilization of equipment and reduce downtime.
● Resource Allocation - It can be applied to identify the optimal
allocation plan for boosting overall production levels and
increasing productivity.
➔ STEP 2: Plot the objective function; then, move this line out from the
origin to locate the optimal solution point.
● The second step in the graphical solution method is to locate the
point in the feasible solution area that will result in the greatest
total profit. To begin the solution analysis, we first plot the
objective function line for an arbitrarily selected level of profit.
1. Make a fictitious situations wherein the two methods (QM for windows and
excel spreadsheet ) are applied
➔ Jen's Cafe wants to optimize its production in order to satisfy the daily
demands of their best-selling coffee products. They frequently run out
of popular blends and want to determine the optimal production
quantities to maximize profit while using all available ingredients.
Average Forecaste
Coffe Minimum Lead Budget
Scenari Daily d Daily Reorder Unit Cost
e Grind Time Constrain
o Usage Demand Point (lbs) ($/lb)
Blend (g/drink) (Days) t
(lbs) (lbs)
Base Dark
5 18 5.25 3 18.75 10 200
Case Roast
Demand Dark
6 18 6.3 3 21.9 10 200
Spike Roast
Price
Dark
Fluctuati 5 18 5.25 3 18.75 11 200
Roast
on
Delivery Dark
5 18 5.25 4 25 10 200
Delay Roast
The Jen’s Cafe spreadsheet helps optimize coffee bean orders. The sensitivity analysis
shows that:
Basketball 3 4
Football 2 5
Each basketball produced results in a profit of $12, and each football earns $16
in profit.
a. Formulate a linear programming model to determine the number of
basketballs and footballs to produce in order to maximize profit.
➔ Objective Function
Maximize: Z = 12x1 + 16x2
Subject to:
Constraint 1: 3x1 + 2x2 ≤ 500
Constraint 2: 4x1 + 5x2 ≤ 800
x1, x2 ≥ 0
subject to:
3x1 + 2x2 + S1
4x1 + 5x2 + S2
x1, x2, S1, S2 ≥ 0
b. What would be the effect on the optimal solution if the profit for a
basketball changed from $12 to $13? What would be the effect if the
profit for a football changed from $16 to $15?
➔ If the profit for a basketball changed from $12 to $13, the profit
will change from $2560 to $2585.71. In addition, the usage of
rubber will change to 500 and there will be no leftovers that will
occur.
➔ If the profit for a basketball changed from $16 to $15, only the
profit will change to $2400 from the original $2560.
Data:
Demand: 1000 units of jackets (Product Y)
Available Fabric: 1200 meters (Constraint 1)
Cost per Unit Time $20 per hour $15 per hour
Let:
TC = 20𝑥1 + 15𝑥2
Constraints:
1. Fabric Availability: The total fabric used by both lines cannot exceed
the available amount (Constraint 1).
1.2𝑥1 + 1𝑥2 ≤ 1200
2. Production Requirement: The total production from both lines must
meet the demand for jackets (Constraint 2).
10𝑥1 + 5𝑥2 ≥ 1000
Here are the results of the objective function at each of the points in the
feasible region:
2. On their farm, the Friendly family grows apples that they harvest each fall and
make into three products—apple butter, applesauce, and apple jelly. They sell
these three items at several local grocery stores, at craft fairs in the region, and
at their own Friendly Farm Pumpkin Festival for 2 weeks in October. Their
three primary resources are cooking time in their kitchen, their own labor
time, and the apples. They have a total of 500 cooking hours available, and it
requires 3.5 hours to cook a 10-gallon batch of apple butter, 5.2 hours to cook
10 gallons of applesauce, and 2.8 hours to cook 10 gallons of jelly. A 10-gallon
batch of apple butter requires 1.2 hours of labor, a batch of sauce takes 0.8
hour, and a batch of jelly requires 1.5 hours. The Friendly family has 240 hours
of labor available during the fall. They produce about 6,500 apples each fall. A
batch of apple butter requires 40 apples, a 10-gallon batch of applesauce
requires 55 apples, and a batch of jelly requires 20 apples. After the products
are canned, a batch of apple butter will generate $190 in sales revenue, a batch
of applesauce will generate a sales revenue of $170, and a batch of jelly will
generate sales revenue of $155. The Friendlys want to know how many batches
of apple butter, applesauce, and apple jelly to produce in order to maximize
their revenues.
a. Formulate a linear programming model for this problem.
➔ Decision Variable
Apple butter = x1
Apple sauce = x2
Apple Jelly = x3
➔ Constraints
For cooking hours: 3.5x1 + 5.2x2 + 2.8x3 ≤ 500
For labor hours: 1.2x1 + 0.8x2 + 1.5x3 ≤ 240
For total apple falls: 40x1 + 55x2 + 20x3 ≤ 6500
Non-negativity: x1, x2, x3 ≥ 0
➔ Objective Function
Maximize Z = 190x1+ 170x2+ 155x3
Sensitivity Analysis
Apple butter in Z
Output from QM
Sensitivity Analysis
Apple butter in Z
b. Instead of feeding the leftover apples to the livestock, the Friendlys
are thinking about producing apple cider. Cider will require 1.5 hours of
cooking, 0.5 hour of labor, and 60 apples per batch, and it will sell for
$45 per batch. Should the Friendlys use all their apples and produce
cider along with their other three products?
➔ Decision Variable
Apple butter = x1
Apple sauce = x2
Apple Jelly = x3
Cider = x4
➔ Constraints
For cooking hours: 3.5x1 + 5.2x2 + 2.8x3 + 1.5x4 = 500
For labor hours: 1.2x1 + 0.8x2 + 1.5x3 + 0.5x4 = 240
For total apple falls: 40x1 + 55x2 + 20x3+ 60x4 = 6500
Output from QM
NAME: DUMPIT, JENELYN E. JULY 17, 2024
YEAR & SECTION: BSA 2-3 CHAPTER 5
1. Apply the three types of integer programming models in any areas of business
you want. Provide your own fictitious data as well.
● 1st Scenario: A hospital needs to schedule nurses for different shifts
(morning, afternoon, night) while ensuring that the number of nurses
meets the demand for each shift.
Data
● Shifts: Morning, Afternoon, Night
● Demand (nurses): Morning: 5, Afternoon: 6, Night: 4
● Available Nurses: 10
● Maximum Shifts per Nurse: 2
Model
Define integer variables nijfor the number of nurses i assigned to shift.
10 3
Objective Function: Minimize Z = ∑ ∑ 𝑛𝑖𝑗
𝑖=1 𝑗=1
Constraints:
10
○ ∑ 𝑛𝑖1 = 5 (Morning Demand)
𝑖=1
10
○ ∑ 𝑛𝑖2 = 6 (Afternoon Demand)
𝑖=1
10
○ ∑ 𝑛𝑖3 = 4 (Night Demand)
𝑖=1
3
○ ∑ 𝑛𝑖𝑗 ≤ 2 ∀i (Maximum shifts per nurse)
𝑗=1
● 2nd Scenario: "Cozy Couches" is a furniture retailer that sells two types
of couches: a two-seater (S) and a three-seater (L). They want to
determine the optimal order quantity for each type of couch to
minimize total inventory holding costs while meeting forecasted
demand for the upcoming quarter.
Data:
Demand:
Cost:
● Ordering cost per order: $100 (fixed cost for placing an order)
● Holding cost per unit per quarter:
● Two-seater (S): $5
● Three-seater (L): $8
● Storage Constraints:
○ Maximum storage space available: 200 square meters
● Decision Variables:
○ X_S: Number of two-seater couches to order
○ X_L: Number of three-seater couches to order
● Constraints:
○ Demand Satisfaction: X_S >= 80 (Meet demand for two-seaters)
X_L >= 50 (Meet demand for three-seaters)
○ Storage Limitation: 5 * X_S + 8 * X_L <= 200 (Square meter
constraint)
○ Non-negativity: X_S >= 0, X_L >= 0 (We cannot order a negative
number of couches)
Data
● Potential Locations: A, B, C, D, E
● Population Covered (in thousands): A: 50, B: 60, C: 70, D: 80, E: 90
● Cost (in $ thousands): A: 20, B: 25, C: 30, D: 35, E: 40
● Budget: $70,000
Model
Constraints:
● Objective Function
○ Generating profits, reducing expenses, or reaching the best
possible balance between different performance measures are
typical goals of businesses. This target is clearly defined by the
objective function in an IP model, which directs the solution
toward the most desirable result.
● Constraints
○ Many business challenges are complicated to solve without a
systematic approach since they entail a lot of potential decision
combinations. IP models help in quickly sifting through various
combinations in trying to find the most efficient solution.
NAME: DUMPIT, JENELYN E. JULY 17, 2024
YEAR & SECTION: BSA 2-3 CHAPTER 6
Business Problem
A concrete company transports concrete from three plants to three construction
sites. The supply capacities of the three plants, the demand requirements at the
three sites, and the transportation costs per ton are as follows:
Solution:
● The Linear Programming Model Formulation
● Excel Solution
Given the above information:
1. Determine the decision variables, objective function and constraints of this
problem.
2. Using your own excel Solver, show how you arrive on the solution. (Include
steps and screenshot)
Note: If you don’t have a laptop/computer or Excel Solver for No.2, create
(write) the steps based on the previous discussions and modules and use the
above Excel spreadsheet as reference for the cell numbers etc.
Once the solver function is installed, enter your data as given, with 3
tables for the variables, the objectives, and the constraint. Under the
constraint table are inequalities and RHS tables.
➔ Step 3: Select the solver function under the data tab of your excel.
➔ Step 4: A window such as the one below should appear, enter the
specific data needed in each field. Enter the objectives if minimize or
maximize, enter the variables, and enter the constraints.
➔ Step 5: Select the solving method to “Simplex LP.” Then, click “Solve.”
I.
1. Network
2. Minimal Spanning Tree Problem
3. Shortest Route Problem
4. Nodes and Branches
5. Maximal Flow Problem
II. Application
1. Draw a simple network flow for the following situations
a. Toll highway with one entry and five various destinations. A tll
booth must be setup in every exit.
● Data:
Nodes: Represent key points in the road network,
including:
○ N1: Starting point (intersection before the
collapsed bridge)
○ N2: Intersection after the collapsed bridge
(currently inaccessible)
○ N3: Intersection of a secondary road
(potential detour route)
○ N4: Intersection of another secondary road
(potential detour route)
○ N5: End point (intersection where the
highway rejoins the original route)
● Constraints:
○ Limited capacity on secondary roads (E1, E2):
They can handle a maximum of 2,000
vehicles per hour.
○ Construction delays: Route sections near the
collapsed bridge (E3, E4) may experience
delays due to construction activity, potentially
adding 5 minutes to travel time.
● Network Analysis:
Here, we can use network analysis software or a
spreadsheet to model the traffic flow through the
network. We can consider two main approaches:
● Shortest Path Algorithm: This prioritizes the
shortest distance for each route.
● Data:
Nodes: Represent companies in the network
● Stellar Gadgets (Central Node)
● Supplier A (Screens)
● Supplier B (Batteries)
● Supplier C (Straps)
● Supplier D (Manufacturer for Supplier B) (Tier 2
Supplier)
● Constraints:
○ Limited resources for monitoring all suppliers
equally.
○ Dependence on a single manufacturer (Supplier D)
for a critical component (batteries).
1. What is a project?
➔ A project is defined as a series of tasks that must be completed to reach
a desired outcome.
7. Identify the different models used in Multiciteria Decision Making and provide
one example each. Provide your situations or data and use the model
presented here to find a solution
● Simple Additive Weighting (SAW) - it assigns weights to each criterion
based on its importance, then sums the weighted scores of each option
across all criteria. The option with the highest overall score is preferred.
● Example: You're choosing a new smartphone. Here are your criteria and
their weights:
○ Criteria | Weight | Description *---|---|---|
○ Screen Size | 0.3 | Larger screen is more desirable
○ Battery Life | 0.25 | Longer battery life is preferred
○ Camera Quality | 0.3 | Better camera quality is desired
○ Price | 0.15 | Lower price is better
● Here are scores (out of 10) for three phones you're considering:
Phone | Screen Size | Battery Life | Camera Quality | Price
*---|---|---|---|---|
A | 8 | 7 | 8 | 500
B | 6 | 9 | 7 | 400
C | 9 | 6 | 9 | 600
● Solution:
Calculate the weighted score for each phone:
● Phone A: (8 * 0.3) + (7 * 0.25) + (8 * 0.3) + (500 * 0.15) = 5.9
● Phone B: (6 * 0.3) + (9 * 0.25) + (7 * 0.3) + (400 * 0.15) = 5.75
● Phone C: (9 * 0.3) + (6 * 0.25) + (9 * 0.3) + (600 * 0.15) = 6.15
Solution:
● TOPSIS involves complex calculations, but software or online
tools can be used. Based on the concept, locations with lower
rent, higher foot traffic, more parking, and further distance from
competitors would be closer to the ideal solution.
● Analytic Hierarchy Process (AHP) - it decomposes the decision problem
into a hierarchy with a goal at the top, criteria at the next level, and
options at the bottom. Then, it uses pairwise comparisons to assess the
relative importance of criteria and the performance of each option
against each criterion. Finally, it aggregates these comparisons to arrive
at an overall ranking of the options.
● Pairwise Comparisons:
○ You compare how important RP is compared to R (e.g., RP is
twice as important as R).
○ You compare how each option performs against each criterion
(e.g., Stock A has a slightly higher expected return
NAME: DUMPIT, JENELYN E. JULY 17, 2024
YEAR & SECTION: BSA 2-3 CHAPTER 10
10. What makes probability more realistic than when you just make a guess
involving a particular situation? Discuss.
➔ Probability is more realistic than just making a guess because the
former relies on data or prior knowledge about similar situations,
whereas the latter is often based on limited information or intuition,
making it less reliable.
NAME: DUMPIT, JENELYN E. JULY 17, 2024
YEAR & SECTION: BSA 2-3 CHAPTER 12
1. What are the elements of waiting line analysis and how can you possibly
improve the flow in the queue by means of this concept? Provide three
examples.
➔ Waiting line analysis is the mathematical study of waiting in line. It
examines the entire system of waiting in line, including elements like
queue discipline, calling population, arrival rate, and service rate. The
distinction between such elements is that queue discipline describes
the manner in which customers who are waiting are attended to. It
could either be on a first-come, first-served basis, according to a
predetermined appointment, or the customers are processed
alphabetically according to their last names, such as at school
registration or at job interviews. The calling population is the source of
customers for the market. The arrival rate is the rate at which customers
arrive at the service facility during a specified period of time, whereas
the service rate is the average number of customers who can be served
during a specified period of time.
3. What is a finite queue length and how it may affect the waiting line? Discuss.
➔ Finite queue length refers to a waiting line system in which the length
of the queue is limited by the actual space in which it forms; space may
only allow a limited number of customers to enter the queue. Unlike an
infinite queue, which allows customers to join the line indefinitely, a
finite queue forces customers to behave differently when the queue
reaches capacity. For example, if a customer arrives and discovers that
the queue is full, they may give up their attempt to join it and seek
service elsewhere. This is especially true in drive-thrus, where there are
a limited number of vehicles that can wait in line. That is why, waiting
line models are crucial for businesses because they have a direct impact
on customer service perception and the costs of providing service.
NAME: DUMPIT, JENELYN E. JULY 17, 2024
YEAR & SECTION: BSA 2-3 CHAPTER 14