منابع مشابه
A Portfolio Decomposition Formula
Abstract. This paper derives a portfolio decomposition formula when the agent maximizes utility of her wealth at some finite planning horizon. The financial market is complete and consists of multiple risky assets (stocks) plus a risk free asset. The stocks are modelled as exponential Brownian motions with drift and volatility being Itô processes. The optimal portfolio has two components: a myo...
متن کاملSigned Simplicial Decomposition and Overlay of n-D Polytope Complexes
Polytope complexes are the generalisation of polygon meshes in geoinformation systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straightforward dimension-independent database representation called Relational Complex. Accordingly, complex overlay is the corresponding generalisation of map overlay in GIS to ar...
متن کاملDecomposition for adjustable robust linear optimization subject to uncertainty polytope
We present in this paper a general decomposition framework to solve exactly adjustable robust linear optimization problems subject to polytope uncertainty. Our approach is based on replacing the polytope by the set of its extreme points and generating the extreme points on the fly within row generation or column-and-row generation algorithms. The novelty of our approach lies in formulating the ...
متن کاملDecomposition Algorithm for the Single Machine Scheduling Polytope
Given an n-vector p of processing times of jobs, the single machine scheduling polytope C arises as the convex hull of completion times of jobs when these are scheduled without idle time on a single machine. Given a point x ∈ C, Carathéodory’s theorem implies that x can be written as convex combination of at most n vertices of C. We show that this convex combination can be computed from x and p...
متن کاملA Combinatorial Proof of a Formula for Betti Numbers of a Stacked Polytope
For a simplicial complex ∆, the graded Betti number βi,j(k[∆]) of the StanleyReisner ring k[∆] over a field k has a combinatorial interpretation due to Hochster. Terai and Hibi showed that if ∆ is the boundary complex of a d-dimensional stacked polytope with n vertices for d ≥ 3, then βk−1,k(k[∆]) = (k − 1) ` n−d k ́ . We prove this combinatorially.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 2015
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091515000401