The solution of a class of limited diversification portfolio selection problems

Simple item page
dc.contributor.advisorBixby, Robert E.en_US
dc.contributor.advisorDennis, John E., Jr.en_US
dc.creatorButera, Gwyneth Owensen_US
dc.date.accessioned2009-06-04T06:45:33Zen_US
dc.date.available2009-06-04T06:45:33Zen_US
dc.date.issued1997en_US
dc.description.abstractA branch-and-bound algorithm for the solution of a class of mixed-integer nonlinear programming problems arising from the field of investment portfolio selection is presented. The problems in this class are characterized by the inclusion of the fixed transaction costs associated with each asset, a constraint that explicitly limits the number of distinct assets in the selected portfolio, or both. Modeling either of these forms of limiting the cost of owning an investment portfolio involves the introduction of binary variables, resulting in a mathematical programming problem that has a nonconvex feasible set. Two objective functions are examined in this thesis; the first is a positive definite quadratic function which is commonly used in the selection of investment portfolios. The second is a convex function that is not continuously differentiable; this objective function, although not as popular as the first, is, in many cases, a more appropriate objective function. To take advantage of the structure of the model, the branch-and-bound algorithm is not applied in the standard fashion; instead, we generalize the implicit branch-and-bound algorithm introduced by Bienstock (3). This branch-and-bound algorithm adopts many of the standard techniques from mixed-integer linear programming, including heuristics for finding feasible points and cutting planes. Implicit branch-and-bound involves the solution of a sequence of subproblems of the original problem, and thus it is necessary to be able to solve these subproblems efficiently. For each of the two objective functions, we develop an algorithm for solving its corresponding subproblems; these algorithms exploit the structure of the constraints and the objective function, simplifying the solution of the resulting linear systems. Convergence for each algorithm is proven. Results are provided for computational experiments performed on investment portfolio selection problems for which the cardinality of the universe of assets available for inclusion in the selected portfolio ranges in size from 52 to 1140.en_US
dc.format.extent143 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS MATH.SCI. 1997 BUTERAen_US
dc.identifier.citationButera, Gwyneth Owens. "The solution of a class of limited diversification portfolio selection problems." (1997) Diss., Rice University. <a href="https://hdl.handle.net/1911/19140">https://hdl.handle.net/1911/19140</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/19140en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectMathematicsen_US
dc.subjectFinanceen_US
dc.subjectOperations researchen_US
dc.subjectSocial sciencesen_US
dc.subjectApplied sciencesen_US
dc.subjectPure sciencesen_US
dc.subjectinvestmenten_US
dc.subjectnonlinear programmingen_US
dc.titleThe solution of a class of limited diversification portfolio selection problemsen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentMathematical Sciencesen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
9727535.PDF
Size:
4.25 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Theses and Dissertations