首页> 外文OA文献 >A Polynomial Algorithm for a NP-hard to solve Optimization Problem
【2h】

A Polynomial Algorithm for a NP-hard to solve Optimization Problem

机译:求解Np难以求解优化问题的多项式算法

摘要

Since Markowitz in 1952 described an efficient and practical way of finding the optimal portfolio allocation in the normal distributed case, a lot of progress in several directions has been made. The main objective of this thesis is to replace the original risk measure of the Markowitz setting by a more suitable one, Value-at-Risk. In adressing the optimal allocation problem in a slightly more general setting, thereby still allowing for a large number of different asset classes, an efficient algorithm is developed for finding the exact solution in the case of specially distributed losses. Applying this algorithm to even more general loss distributions results in a not necessarily exact matching of the VaR optimum. However, in this case, upper bounds for the euclidean distance between the exact optimum and the output of the proposed algorithm are given. An investigation of these upper bounds shows, that in general the algorithm results in quite good approximations to the VaR optimum. Finally, an application of a stochastic branch & bound algorithm to the current problem is discussed.
机译:自从Markowitz在1952年描述了一种在正态分布情况下寻找最优投资组合分配的有效且实用的方法以来,已经在多个方向上取得了许多进展。本文的主要目的是用一种更合适的风险价值替代Markowitz设置的原始风险度量。为了在更一般的情况下解决最优分配问题,从而仍然允许使用大量不同的资产类别,开发了一种有效的算法,用于在特殊分配的损失情况下找到确切的解决方案。将该算法应用于甚至更一般的损耗分布会导致VaR最优值不一定精确匹配。但是,在这种情况下,给出了精确最优值与所提出算法的输出之间的欧式距离的上限。对这些上限的研究表明,一般而言,该算法可得出与VaR最优值相当好的​​近似值。最后,讨论了随机分支定界算法在当前问题中的应用。

著录项

  • 作者

    Eberle Stefan;

  • 作者单位
  • 年度 2009
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类
  • 入库时间 2022-08-20 21:04:20

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号