{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/61296"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/61296","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Portfolio optimization with transaction costs and preconceived portfolio weights","abstract":"In the financial world, many quantitative investment managers have developed sophisticated statistical techniques to generate signals about expected returns from previous market data. However, the manner in which they apply this information to rebalancing their portfolios is often ad-hoc, trading off between rebalancing their assets into an allocation that generates the greatest expected return based on the generated signals and the incurred transaction costs that the reallocation will require. In this thesis, we develop an approximation to our investor's true value function which incorporates both return predictability and transaction costs. By optimizing our approximate value function at each time step, we will generate a portfolio strategy that closely emulates the optimal portfolio strategy, which is based on the true value function. In order to determine the optimal set of parameters for our approximate function which will generate the best overall portfolio performance, we develop a simulation-based method. Our computational implementation is verified against well-known base cases. We determine the optimal parameters for our approximate function in the single stock and bond case. In addition, we determine a confidence level on our simulation results. Our approximate function gives us useful insight into the optimal portfolio allocation in complex higher dimensional cases. Our function derivation and simulation methodology extend easily to portfolio allocation in higher dimensional cases, and we implement the modifications required to run these simulations. Simple cases are tested and more complex tests are specified for testing when appropriate dedicated computing resources are available.","abstract_html":"In the financial world, many quantitative investment managers have developed sophisticated statistical techniques to generate signals about expected returns from previous market data. However, the manner in which they apply this information to rebalancing their portfolios is often ad-hoc, trading off between rebalancing their assets into an allocation that generates the greatest expected return based on the generated signals and the incurred transaction costs that the reallocation will require. In this thesis, we develop an approximation to our investor's true value function which incorporates both return predictability and transaction costs. By optimizing our approximate value function at each time step, we will generate a portfolio strategy that closely emulates the optimal portfolio strategy, which is based on the true value function. In order to determine the optimal set of parameters for our approximate function which will generate the best overall portfolio performance, we develop a simulation-based method. Our computational implementation is verified against well-known base cases. We determine the optimal parameters for our approximate function in the single stock and bond case. In addition, we determine a confidence level on our simulation results. Our approximate function gives us useful insight into the optimal portfolio allocation in complex higher dimensional cases. Our function derivation and simulation methodology extend easily to portfolio allocation in higher dimensional cases, and we implement the modifications required to run these simulations. Simple cases are tested and more complex tests are specified for testing when appropriate dedicated computing resources are available.","abstract_has_math":false,"creators":["Myers, Jeremy D. (Jeremy Dale)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Leonid Kogan."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:22:30Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/61296","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Leonid Kogan."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Myers, Jeremy D. (Jeremy Dale)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-02-23T15:00:37Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-02-23T15:00:37Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/61296"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 87-88)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In the financial world, many quantitative investment managers have developed sophisticated statistical techniques to generate signals about expected returns from previous market data. However, the manner in which they apply this information to rebalancing their portfolios is often ad-hoc, trading off between rebalancing their assets into an allocation that generates the greatest expected return based on the generated signals and the incurred transaction costs that the reallocation will require. In this thesis, we develop an approximation to our investor's true value function which incorporates both return predictability and transaction costs. By optimizing our approximate value function at each time step, we will generate a portfolio strategy that closely emulates the optimal portfolio strategy, which is based on the true value function. In order to determine the optimal set of parameters for our approximate function which will generate the best overall portfolio performance, we develop a simulation-based method. Our computational implementation is verified against well-known base cases. We determine the optimal parameters for our approximate function in the single stock and bond case. In addition, we determine a confidence level on our simulation results. Our approximate function gives us useful insight into the optimal portfolio allocation in complex higher dimensional cases. Our function derivation and simulation methodology extend easily to portfolio allocation in higher dimensional cases, and we implement the modifications required to run these simulations. Simple cases are tested and more complex tests are specified for testing when appropriate dedicated computing resources are available."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Portfolio optimization with transaction costs and preconceived portfolio weights"]}]}],"canonical_facts":{"dc:contributor.advisor":["Leonid Kogan."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Myers, Jeremy D. (Jeremy Dale)"],"dc:date.accessioned":["2011-02-23T15:00:37Z"],"dc:date.available":["2011-02-23T15:00:37Z"],"dc:date.issued":["2009"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 87-88)."],"dc:description.abstract":["In the financial world, many quantitative investment managers have developed sophisticated statistical techniques to generate signals about expected returns from previous market data. However, the manner in which they apply this information to rebalancing their portfolios is often ad-hoc, trading off between rebalancing their assets into an allocation that generates the greatest expected return based on the generated signals and the incurred transaction costs that the reallocation will require. In this thesis, we develop an approximation to our investor's true value function which incorporates both return predictability and transaction costs. By optimizing our approximate value function at each time step, we will generate a portfolio strategy that closely emulates the optimal portfolio strategy, which is based on the true value function. In order to determine the optimal set of parameters for our approximate function which will generate the best overall portfolio performance, we develop a simulation-based method. Our computational implementation is verified against well-known base cases. We determine the optimal parameters for our approximate function in the single stock and bond case. In addition, we determine a confidence level on our simulation results. Our approximate function gives us useful insight into the optimal portfolio allocation in complex higher dimensional cases. Our function derivation and simulation methodology extend easily to portfolio allocation in higher dimensional cases, and we implement the modifications required to run these simulations. Simple cases are tested and more complex tests are specified for testing when appropriate dedicated computing resources are available."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/61296"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Portfolio optimization with transaction costs and preconceived portfolio weights"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:30Z"}