INTRODUCTION TO INDUSTRIAL ENGINEERING APPLICATIONS IN FINANCIAL ASSET MANAGEMENT

By -
INTRODUCTION

Over the last decade, the challenges faced by asset managers have become significantly more com- plex. The array of investment choices has expanded tremendously in response to globalization and financial engineering. New products are now available such as collateralized debt, insurance-linked securities, and exotic structured products. At the same time, the need for investment planning has shifted more to individuals as companies and public entities relinquish responsibility for retirement programs.

Because of this incredible change in the investment world, institutions such as pension plan administrators, endowments, foundations, and asset managers are under greater pressure than ever to produce higher portfolio returns. This is the genesis for embracing new assets, which hopefully will generate superior investment performance than plain vanilla portfolios of stocks and bonds. Better returns reduce the need for future cash injections to fund obligations.

Unfortunately, market risks have increased as the array of available investment instruments has broadened. For example, the Mexican peso crisis in 1994, the Asian currency debacle and recession beginning in 1997, the Russian debt default and the unprecedented hedge fund bail-out coordinated by the Federal Reserve Bank in 1998, and a 30% drop in the price of technology shares early in 2000 all had major repercussions for financial markets. Where is an investor to find solace in such an unfriendly and disturbing environment?

The obvious answer to heightened complexity and uncertainty lies in utilizing financial engi- neering techniques to manage asset portfolios. This chapter reviews the current state of the art from a practitioner’s perspective. The prime focus is on mean-variance optimization techniques, which remain the principal application tool. The key message is that while the methods employed by today’s specialists are not especially onerous mathematically or computationally, there are major issues in problem formulation and structure. It is in this arena that imagination and inventiveness take center stage.

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

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