INDUSTRIAL ENGINEERING APPLICATIONS IN FINANCIAL ASSET MANAGEMENT:THE OPTIMIZATION PROBLEM

By -
THE OPTIMIZATION PROBLEM

The specific mathematical formulation for the standard MV problem is straightforward:

Industrial Engineering Applications in Financial Asset Management-0009

Equation (1) incorporates the investor’s attitude to risk via the objective function U. Equation (2) represents the portfolio return. Equation (3) is portfolio risk. Constraint (4) requires that the portfolio weights sum to 100%, while constraint (5) requires that weights be positive. This latter restriction can be dropped if short selling is allowed, but this is not usually the case for most investors.

This formulation is a standard quadratic programming problem for which an analytical solution exists from the corresponding Kuhn–Tucker conditions. Different versions of the objective function are sometimes used, but the quadratic version is appealing theoretically because it allows investor preferences to be convex.

The set of efficient portfolios can be produced more simply by solving

Industrial Engineering Applications in Financial Asset Management-0010

A vast array of alternative specifications is also possible. Practitioners often employ additional ine- quality constraints on portfolio weights, limiting them to maximums, minimums, or linear combi- nations. For example, total equity exposure may be restricted to a percentage of the portfolio or cash to a minimum required level. Another common variation is to add inequality constraints to force solutions close to benchmarks. This minimizes the risk of underperforming.

With respect to computation, for limited numbers of assets (small J ), solutions are easily obtained (although not necessarily efficiently) using standard spreadsheet optimizers. This works for the vast majority of allocation problems because most applications typically include no more than a dozen assets. More specialized optimizers are sometimes necessary when there are many assets. For ex- ample, if MV is applied to select a stock portfolio, there may be hundreds of securities used as admissible ‘‘assets.’’

Comments

Post a Comment

Popular posts from this blog

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 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

INTEGER PROGRAMMING:THE BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS

By -
TH E BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS Integer programming has been an especially exciting area of OR since the mid-1980s be- cause of the dramatic progress being made in its solution methodology. Background To place this progress into perspective, consider the historical background. One big break- through had come in the 1960s and early 1970s with the development and refinement of the branch-and-bound approach. But then the state of the art seemed to hit a plateau. Rel- atively small problems (well under 100 variables) could be solved very efficiently, but even a modest increase in problem size might cause an explosion in computation time be- yond feasible limits. Little progress was being made in overcoming this exponential growth in computation time as the problem size was increased. Many important problems arising in practice could not be solved. Then came the next breakthrough in the mid-1980s, with the introduction of the b r an c h- and-cu t approach to sol...
Read more