Abstract
The aim of this paper is to study the possibility to obtain efficient as well as satisfying solutions when solving a general non linear convex Goal Programming problem. Firstly. uniqueness conditions are given under which we can assure that the solution obtained is efficient. In case it is not efficient, some methods to obtain them are proposed, for both cases when there exist satisfying solutions for the problem, and when they do not exist In the first case. that is, when there exist satisfying solutions, an algorithm to approximate th e set of solutions which are satisfying and efficient at the same time is given . Finally. some computational results are offered, showing the behaviour of the algorithm with several test problems
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.
