ENGINEERING CLIENT-TAILORED SOLUTIONS: APPLYING PORTFOLIO RESTRICTIONS

By -
ENGINEERING CLIENT-TAILORED SOLUTIONS: APPLYING PORTFOLIO RESTRICTIONS

The discussion so far has focused on asset allocation as generally applicable to a broad cross-section of investors. In reality, the vast majority of individual investors face special restrictions that limit their flexibility to implement optimal portfolios. For example, many investors hold real estate, con- centrated stock holdings, VC or LBO partnerships, restricted stock, or incentive stock options that for various reasons cannot be sold. For these investors, standard MV optimization is still appropriate and they are well advised to target the prescribed optimum portfolio. They should then utilize deriv- ative products such as swaps to achieve a synthetic replication.

Synthetic rebalancing cannot always be done, however. This is likely to be the case for illiquid assets and those with legal covenants limiting transfer. For example, an investor may own a partner- ship or hold a concentrated stock position in a trust whose position cannot be swapped away. In these situations, MV optimization must be amended to include these assets with their weights re- stricted to the prescribed levels. The returns, risk, and correlation forecasts for the restricted assets must then be incorporated explicitly in the analysis to take account of their interaction with other assets. The resulting constrained optimum portfolios will comprise a second-best efficient frontier but may not be too far off the unconstrained version.

An interesting problem arises when investors own contingent assets. For example, incentive stock options have no liquid market value if they are not yet exercisable, but they are nonetheless worth

something to the investor. Because banks will not lend against such options and owners cannot realize value until exercise, it can be argued that they should be excluded from asset allocation, at least until the asset can be sold and income received. Proceeds should then be invested consistent with the investor’s MV portfolio. An alternative is to probabilistically discount the potential value of the option to the present and include the delta-adjusted stock position in the analysis. To be complete, the analysis must also discount the value of other contingent assets such as income flow after taxes and living expenses.

Comments

Post a Comment

Popular posts from this blog

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more