Professional Documents
Culture Documents
Chapter 5
Section 1
Capital Budgeting
Chapter 5
Investment Decisions
Chapter 5
Capital Budgeting
Chapter 5
Independent Projects
Chapter 5
Formulation
Maximize Pm
P
i=1 bi xi
m
subject to i=1 ci xi ≤ C
xi = 0 or 1, i = 1, 2, · · · , m
where
m: number of projects proposed
bi : total benefit (NPV) of Project i
ci : initial cost of Project i
C: total budget available
xi (0-1 or binary decision variable): xi = 1 if Project i
accepted and xi = 0 if otherwise
A 0 − 1 programming problem (0 − 1 Knapsack Problem)
Chapter 5
An Approximate Algorithm
Chapter 5
Example: A Selection Problem
Chapter 5
Mathematical Formulation
Chapter 5
Approximate vs Exact Solutions
Chapter 5
Section 2
Optimal Portfolios
Chapter 5
Optimal Portfolios
Chapter 5
Formulation
Pm
Minimize p j xj
Pj=1
m
subject to j=1 cij xj ≥ yi , i = 1, 2, · · · , n
xj ≥ 0, j = 1, 2, · · · , m
where
m: number of bonds under consideration
n: number of periods where the obligations occur
pj : price of Bond j
cij : cash payment of Bond j at the end of period i
yi : obligation at end of period i
xj : amount of bond j to be purchased
A linear programming problem!
Chapter 5
Example: A 6-Year Match
Chapter 5
Section 3
Valuation of a Firm
Chapter 5
Valuation of a Firm
Chapter 5
Valuation of a Firm (Cont’d)
Chapter 5
Dividend Discount Model
D1 D2 D3
V0 = + 2
+ + ···
1 + r (1 + r) (1 + r)3
where
Dk : expected dividend in year k
r: (fixed) interest rate
V0 : value of the firm
Chapter 5
Constant-Growth Dividend Model
Dk+1 = (1 + g)Dk , k = 1, 2, · · ·
Chapter 5
Discounted Growth Formula
(1 + g)D0
V0 =
r−g
where D0 is the current dividend
Chapter 5
Example: The XX Corporation
Chapter 5
Free Cash Flow
Chapter 5
Income Statement
Chapter 5
Free Cash Flow (Cont’d)
Chapter 5
Example: The YY Corporation
Chapter 5
Solution to The YY Corporation
Chapter 5