Optimizing Business Investments A Case Study
Optimizing Business Investments A Case Study
ALLOCATION: A LINEAR
PROGRAMMING CASE STUDY
Problem Formulation:
Maximizing Profit
Problem Definition Objective Function
The problem is a linear programming maximization problem The objective is to maximize total profit (Z), which is a linear
with the goal of maximizing total profit. We define four combination of the unit profits for each channel. For
decision variables representing units sold through each example, Z = 90X1 + 84X2 + 70X3 + 60X4. This function
channel: Marine, Business, National Retail, and Direct represents the overall revenue generation goal.
Mail. We also establish constraints related to advertising
budget, sales effort hours, production capacity, and
minimum sales requirements.
Decision Variables
The decision variables represent the number of
units sold through each distribution channel
X1 : Marine Equipment Distributors
X2 : Business Equipment Distributors
X3 : National Chain of Retail Stores
X4 : Direct Mail
Constraints: Shaping the Decision Space
1 Advertising Budget Constraint Sales Effort Hours Constraint
2
This constraint limits the total advertising This constraint limits the total sales effort hours
expenditure. 10X1 + 8X2 + 9X3 + 15X4 ≤ 5000. It available. 2X1 + 3X2 + 3X3 + 0X4 ≤ 1800. It reflects the
reflects the financial resources available for time and resources dedicated to selling the product.
promoting the product across channels.
Slack
There is some slack in the sales effort hours, which suggests an opportunity
to optimize their usage further if other constraints allow.
OPTIMISING BUSINESS
INVESTMENTS: MAXIMIZING
NET PRESENT VALUE
Problem Formulation: Maximising NPV
Problem Definition Objective Function
The problem is a Binary Integer Programming problem with The objective function represents the goal of the problem,
the goal is to maximize the Net Present Value (NPV) of a set which is to maximize the total Net Present Value (NPV) of
of investment options under resource constraints over three selected investments. Each investment has a specific
years. The problem involves binary decision-making, where contribution to the NPV, and the decision to include or
each investment can either be selected (1) or not selected exclude an investment is represented by binary variables.
(0). Constraints include limited capital funds in each year Maximize Total NPV: Z = 4000X1 + 6000X2 + 10500X3 +
and specific business rules regarding investment 4000X4 + 8000X5 + 3000X6
dependencies.
Decision Variables
The decision variables represent the selection of distribution
channels.
X1: Limited Warehouse Expansion
X2: Extensive Warehouse Expansion
X3: Test Market New Product
X4: Advertising Campaign
X5: Basic Research
X6: Purchase New Equipment
Constraints: Shaping the Decision Space
Year 1 Capital
1 3000X1 + 2500X2 + 6000X3 + 2000X4 + 5000X5 + 1000X6 ≤ 10500
Year 2 Capital
2
1000X1 + 3500X2 + 4000X3 + 1500X4 + 1000X5 + 500X6 ≤ 7000
Year 3 Capital
3
4000X1 + 3500X2 + 5000X3 + 1800X4 + 4000X5 + 900X6 ≤ 8750
Binary Constraints
4 X1,X2,X3,X4,X5,X6∈{0,1}
Initial Solution
Selected Investments Maximum NPV
Limited Warehouse Expansion, Test Z = 4000 + 10500 + 8000 = 22500
Market New Product, Basic Research
Capital Check
Year 1: 3000 + 6000 + 5000 = 14000 → Exceeds budget (10500)!
Assuming that only one of the warehouse expansion If test marketing of the new product is carried out,
projects can be implemented. the advertising campaign also must be conducted.
Only One Warehouse Expansion: X1 + X2 ≤ 1 Test Marketing Implies Advertising: X3 ≤ X4
Solution Solution
The solution remains the same as Step (a): The solution remains the same as Step (a):
X1 = 0, X2 = 0, X3 = 1, X4 = 1, X5 = 0, X6 = 1 X1 = 0, X2 = 0, X3 = 1, X4 = 1, X5 = 0, X6 = 1
Note : Considering the Scenarios (b) and (c), if we consider one of the expansion project to be
taken up and test marketing implies advertising; The Selection of investments are Extensive
Warhouse Expansion, Basic Research and Purchase of new equipment. Resulting in the
maximum NPV to be $17000.
THANK YOU