Abstract
In this work is presented a linear multi-objective model that in each iteration is solved a linear programming problem, where the magnitude of the restrictions is obtained by a neighbourhood of the convex search space of feasible solutions. The selection of an investment portfolio through a multiobjective mathematical model indicates that it has several available portfolios. In our model the selection of one of them is performed with the same principle used by the Capital Assets Pricing Model, it is a single point that touches the border of optimal portfolios. The model is tested with a Mexican Stock investment portfolio selection during a period of debacle. This is possible because our model can be applied when there are no positive returns. The results show that using a neighbourhood search within feasible solutions is correct because is possible to obtain investment portfolios with positive profit in periods of debacle.
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 callMore From: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences
Disclaimer: 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.
