辅导案例-MATH 2070/2970

欢迎使用51辅导,51作业君孵化低价透明的学长辅导平台,服务保持优质,平均费用压低50%以上! 51fudao.top
UNIVERSITY OF SYDNEY
School of Mathematics and Statistics
MATH 2070/2970 Optimisation and Financial Mathematics
2019 Semester 2
Sample Exam Questions
1. (a) A company makes two types of bookshelf, a deluxe one out of craft wood and a budget
one out of particle board. It can sell all it produces. The deluxe bookshelf sells for $60
and the budget for $40. The materials and overheads in a deluxe bookshelf cost $14 and
in a budget bookshelf $10. The deluxe bookshelf takes 0.4 hours to machine and 0.2 hours
to assemble; the budget bookshelf takes 0.2 hours to machine and 0.2 hours to assemble.
Machining costs $30 per hour and assembling costs $20 per hour. If the company has 24
hours of machining per week and 16 hours of assembling per week, how many bookshelves
of each type should it produce to maximise its profit?
Formulate this problem mathematically and then solve it graphically.
(b) Consider the following linear programming problem,
Max Z = 2x1 + x2 + 2x3
subject to 2x1 + 2x2 + x3 ≤ 18
−x1 − 4x2 − 2x3 ≥ −8
with x1 ≥ 0, x2 ≥ 0, x3 ≥ 0 .
(i) Put this problem into the standard form and then solve it using the simplex algo-
rithm.
(ii) Write down the dual form of the problem (but do not solve it).
(iii) (Adv) From the optimal tableau of the primal problem in Part (i) write down the
optimal solution of the dual problem.
(c) (Adv) The following tableau was obtained after several steps of the simplex algorithm
in a standard linear programming problem. Attempt to complete the algorithm and
interpret your results fully.
Z x1 x2 x3 x4 RHS Ratio
1 0 0 0 1 9
0 1 2 0 7 6
0 0 3 1 4 3
(d) By introducing appropriate variables put the following problem into a form suitable for
the two-phase simplex algorithm. Hence write down an initial feasible corner point for
phase 1. Do not actually implement the algorithm.
Min Z = −2x1 − 3x2 − x3
subject to 2x1 − 5x2 + 2x3 = 24
x1 + x2 − 3x3 ≤ −7
with x1 ≥ 0, x3 ≥ 0.
Copyright c© 2019 The University of Sydney 1
2. A factory manufactures two types of chair X and Y from metal tubing. The factory can purchase
up to 52 units of tubing at a cost of $1 per unit. Six units of the tube can be processed into one
unit of X at a processing cost of $4 for each unit of X produced, and ten units of tube can be
processed into one unit of Y at a processing cost of $8 for each unit of Y produced. If x units
of X are produced and y units of Y are produced, X sells for $(34−x− 2y) per unit and Y sells
for $(58− 2y) per unit. The factory wishes to maximise its profit.
(a) Find the cost in dollars of tubing and the cost in dollars of processing to produce x units
of X and y units of Y. Hence show that the profit in dollars is given by
f(x, y) = x(24− x− 2y) + y(40− 2y).
Formulate the problem as a nonlinear programming problem subject to constraints.
(b) Convert the problem in Part (i) to a minimisation problem and find the corresponding
Lagrangian function, ignoring the non-negativity conditions.
(c) Write down the KKT conditions to determine necessary conditions for maximum profit.
Hence show that the factory maximises its profit if it produces 2 units of X. How many
units of Y should the factory produce to maximise its profit?
(d) (Adv) Why are the conditions in Part (iii) also sufficient?
3. (a) A 2-asset portfolio has parameters:
r =
(
1
2
)
, S =
(
1 −3
−3 9
)
x =
(
x
1− x
)
(i) Use the portfolio equations to find µ(x) and σ(x), and hence show that the feasible
set consists of the pair of straight lines µ = 14(5± σ), σ ≤ 0, in the µσ-plane.
(ii) Sketch the feasible set, the location of the two assets A1 and A2 and find the
minimum risk portfolio P0 in the µσ-plane. What is the allocation to A1 and A2
for P0? Carefully indicate on your sketch which investors allow short-selling of A1,
A2 and no short-selling of either.
(iii) What is the optimal portfolio for an investor who has risk-aversion parameter t = 8?
(b) A 3-asset Markowitz portfolio has parameters:
r =
12
4
 , S =
1 0 00 2 0
0 0 2
 x =
x1x2
x3

Obtain the following
(i) The minimum variance and efficient frontiers in the µσ-plane.
(ii) The allocation vector x as a function of the risk-aversion parameter t.
(iii) The projection of the critical line onto the x1x3-plane.
(iv) The parameters for the minimum risk portfolio.
(v) The investors who short-sell the first asset.
2
(c) (Adv) Write down the Lagrangian for the 3-asset portfolio in Part (b) if there is no
short-selling of asset 1. Derive the KKT conditions for the optimal portfolio. Hence show
that the xi can be written as
x1 = −t+ 1
2
+
1
2
l1
x2 =
1
4
− 1
4
l1
x3 = t+
1
4
− 1
4
l1
Determine l1 and hence derive and sketch the critical line in the x1x3-plane.
4. A portfolio of risky assets has parameters a = 1, b = 3, c = 10. Find the feasible set in the
µσ-plane.
(a) A riskless asset with rate of return r0 = 2 for both lending and borrowing is added to the
portfolio. Find the capital market line.
(b) (Adv) State the one fund theorem in terms of the market portfolio PM . Prove that
tM = 1/(b− ar0). Use this result to find µM and σM .
(c) Determine the allocation to the riskless and risky assets of an investor with a risk aversion
parameter t = 1/5.
3

欢迎咨询51作业君
51作业君

Email:51zuoyejun

@gmail.com

添加客服微信: abby12468