Foreword |
|
ix | |
Preface to Revised Reissue |
|
xv | |
Preface |
|
xvii | |
Part I The General Portfolio Selection Model |
|
|
Portfolio Selection Models |
|
|
3 | (20) |
|
The Standard Mean-Variance Portfolio Selection |
|
|
3 | (4) |
|
Standard Analysis with Upper Bounds |
|
|
7 | (1) |
|
The Tobin-Sharpe-Lintner Model |
|
|
8 | (3) |
|
|
11 | (1) |
|
Model Requiring Collateral for Short Positions |
|
|
11 | (2) |
|
Nominal Versus Real Returns |
|
|
13 | (2) |
|
|
15 | (5) |
|
Mean and variance of weighted sums |
|
|
15 | (5) |
|
|
20 | (1) |
|
|
20 | (3) |
|
The General Mean-Variance Portfolio Selection Model |
|
|
23 | (19) |
|
Three Forms of the General Model |
|
|
24 | (4) |
|
|
28 | (8) |
|
|
36 | (4) |
|
|
40 | (2) |
|
Capabilities and Assumptions of the General Model |
|
|
42 | (31) |
|
Semidefinite Covariance Matrices |
|
|
42 | (1) |
|
Portfolio Constraints in Theory and Practice |
|
|
43 | (1) |
|
|
44 | (1) |
|
|
45 | (3) |
|
|
48 | (2) |
|
|
50 | (1) |
|
|
51 | (1) |
|
|
52 | (4) |
|
|
56 | (1) |
|
Implied Single-period Utility Maximization |
|
|
57 | (2) |
|
|
59 | (4) |
|
Research on EV Approximations |
|
|
63 | (5) |
|
|
68 | (5) |
Part II Preliminary Results |
|
|
Properties of Feasible Portfolio Sets |
|
|
73 | (34) |
|
|
74 | (3) |
|
|
77 | (3) |
|
|
80 | (1) |
|
|
81 | (1) |
|
Spheres, Balls, and Open Sets |
|
|
82 | (4) |
|
|
86 | (3) |
|
|
89 | (3) |
|
Unbounded Constraint Sets |
|
|
92 | (2) |
|
Disallowed Directions and Bounded Feasible Directions |
|
|
94 | (4) |
|
|
98 | (2) |
|
|
100 | (5) |
|
|
105 | (2) |
|
Sets Involving Mean, Variance, and Standard Deviation |
|
|
107 | (18) |
|
|
107 | (2) |
|
Relationships Involving V |
|
|
109 | (4) |
|
Compensating Transformations |
|
|
113 | (1) |
|
|
114 | (2) |
|
|
116 | (1) |
|
|
117 | (3) |
|
Minimum Obtainable V and σ |
|
|
120 | (2) |
|
|
122 | (3) |
|
Portfolio Selection Models with Affine Constraint Sets |
|
|
125 | (26) |
|
Minimization Subject to Constraints |
|
|
125 | (2) |
|
Efficient Portfolios with Affine Constraint Sets |
|
|
127 | (12) |
|
|
139 | (4) |
|
|
143 | (8) |
Part III Solution to the General Portfolio Selection Model |
|
|
Efficient Sets for Nondegenerate Models |
|
|
151 | (33) |
|
|
152 | (2) |
|
|
154 | (3) |
|
|
157 | (4) |
|
Adjacent Efficient Segments |
|
|
161 | (5) |
|
|
166 | (5) |
|
|
171 | (3) |
|
Finiteness of the Critical Line Algorithm |
|
|
174 | (2) |
|
|
176 | (2) |
|
|
178 | (1) |
|
|
179 | (5) |
|
|
184 | (15) |
|
The Simplex Method of Linear Programming |
|
|
185 | (6) |
|
Prices and Profitabilities |
|
|
191 | (2) |
|
Starting the Critical Line Algorithm |
|
|
193 | (2) |
|
|
195 | (4) |
|
|
199 | (26) |
|
Simpler ``Good Enough'' Methods |
|
|
200 | (2) |
|
Efficient Sets when E is Bounded |
|
|
202 | (12) |
|
|
214 | (2) |
|
|
216 | (3) |
|
|
219 | (4) |
|
|
223 | (2) |
|
All Feasible Mean-Variance Combinations |
|
|
225 | (18) |
|
The Top of the Obtainable EV Set |
|
|
229 | (7) |
|
Comaprison of the Top and Bottom of the EV Set |
|
|
236 | (2) |
|
The Sides of the Feasible EV Set |
|
|
238 | (1) |
|
|
239 | (4) |
Part IV Special Cases |
|
|
Canonical Form of the Two-Dimensional Analysis |
|
|
243 | (32) |
|
The Standard Three-security Analysis |
|
|
244 | (4) |
|
Canonical Form when Rank is 2 |
|
|
248 | (5) |
|
Efficient Sets in the Canonical Analysis (Rank 2) |
|
|
253 | (4) |
|
Kinks in the Set of Efficient EV Combinations |
|
|
257 | (2) |
|
Linear Segments in the Set of Efficient Eσ Combinations |
|
|
259 | (3) |
|
|
262 | (3) |
|
The k Dimensional Canonical Analysis |
|
|
265 | (5) |
|
|
270 | (2) |
|
|
272 | (3) |
|
Conical Constraint Sets and the Efficiency of the Market Portfolio |
|
|
275 | (26) |
|
|
276 | (1) |
|
|
277 | (3) |
|
Efficiency of the Market Portfolio |
|
|
280 | (2) |
|
A Simple Market Equilibrium Model |
|
|
282 | (2) |
|
How Inefficient can the Market Portfolio Be? |
|
|
284 | (2) |
|
Expected Returns and Betas |
|
|
286 | (2) |
|
|
288 | (13) |
Part V A Portfolio Selection Program |
|
|
|
301 | (38) |
|
|
|
|
|
|
302 | (1) |
|
|
303 | (1) |
|
|
304 | (1) |
|
|
305 | (1) |
|
|
306 | (6) |
|
The Critical Line Algorithm |
|
|
312 | (6) |
|
Appendix A to Chapter 13: Program Listing |
|
|
318 | (16) |
|
Appendix B to Chapter 13: Integration and Spreadsheet |
|
|
334 | (1) |
|
Appendix C to Chapter 13: Sample Problem |
|
|
335 | (4) |
Appendix Elements of Matrix Algebra and Vector Spaces |
|
339 | (22) |
|
Mathematical Prerequisites |
|
|
339 | (1) |
|
|
339 | (2) |
|
|
341 | (2) |
|
|
343 | (1) |
|
Substitution of Variables |
|
|
344 | (2) |
|
|
346 | (2) |
|
|
348 | (1) |
|
Independence and Subspaces |
|
|
348 | (2) |
|
Change of Coordinate Systems |
|
|
350 | (7) |
|
Change of Coordinates in Rn |
|
|
357 | (4) |
References |
|
361 | (6) |
Index |
|
367 | |