Abstract
We propose a numerical method for solving quantile optimization problems with a bilinear loss function based on approximating the kernel of the probability measure in the space of realizations of the random parameters vector with a convex polyhedron. The original problem reduces to a linear programming problem with a large number of constraints. We present our approach in two modifications: for the case when we know the distribution of random parameters and for the case when we only have a sample from the distribution law. The operation of the proposed approach is illustrated with numerical solutions of portfolio selection.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
