Abstract

In multiobjective optimisation, one of the most common ways of describing the decision maker’s preferences is to assign targeted values (goals) to conflicting objectives as well as relative weights and priority levels for attaining the goals. In linear and convex decision situations, traditional goal programming provides a pragmatic and flexible manner to cater for the above preferences. In certain real world decision situations, however, multiobjective optimisation problems are non-convex. In this paper, a minimax reference point approach is developed which is capable of handling the above preferences in non-convex cases. The approach is based on ∞-norm formulation and can accommodate both preemptive and non-preemptive goal programming. A strongly non-linear multiobjective ship design model is presented and fully examined using the new approach. This simulation study is aimed to illustrate the implementation procedures of the approach and to demonstrate its potential application to general multiobjective optimisation problems.

Full Text
Paper version not known

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.