Abstract

The purpose of the paper is to present some approaches for multiobjective fractional programming with set coefficients in the objective functions. Among other cases, we discuss for linear fractional multiobjective programming some conservative and nonconservative approaches related to Soyster’s mathematical programming with set-inclusive constraints and Dantzig’s generalized linear programming, respectively. The vectorial max-min optimization will be also used as a conservative approach for inexact multiobjective programming. In particular, the conservative approach will be applied to mathematical programming with nondecreasing objectives with respect to the inexact coefficients. Linear-fractional objective functions will be studied from both points of view (conservative and nonconservative). Also, some applications to the fuzzy linear-fractional multiobjective programming will be suggested.

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 call

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.