Abstract
In this work we consider the portfolio selection problems with uncertainties as a kind of multiple objective problem with fuzzy costs in the objective functions. The portfolio selection problems can be classified as convex programming problems. Although convex programming problems are a special class of nonlinear programming, they can also be defined as a general linear programming problem. These problems are of utmost importance in a variety of relevant practical fields. In addition, since ambiguity and vagueness are natural and ever-present in real-life situations requiring solutions, it makes perfect sense to attempt to address them using fuzzy convex programming technique. This work presents a novel fuzzy set based method that solves a class of convex programming problems with vagueness costs in the objective functions. This method transforms a fuzzy convex multi-objective programming problem into a parametric convex multi-objective programming one. When obtain the efficient solutions of the transformed problem, they satisfy an aspiration level defined by a decision maker. This proposed method is applied in two portfolio selection numerical examples by using Latibex data of some Brazilian securities.
Sign-in/Register to access full text options 
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.
