From goal programming for continuous multi-criteria optimization to the target decision rule for mixed uncertain problems

6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Goal programming (GP) is applied to the discrete and continuous version of multi-criteria optimization. Recently, some essential analogies between multi-criteria decision making under certainty (M-DMC) and scenario-based one-criterion decision making under uncertainty (1-DMU) have been revealed in the literature. The aforementioned similarities allow the adjustment of GP to an entirely new domain. The aim of the paper is to create a new decision rule for mixed uncertain problems on the basis of the GP methodology. The procedure can be used by pessimists, optimists and moderate decision makers. It is designed for one-shot decisions. One of the significant advantages of the novel approach is related to the possibility to analyze neutral criteria, which are not directly taken into account in existing classical procedures developed for 1-DMU.

Cite

CITATION STYLE

APA

Gaspars-Wieloch, H. (2022). From goal programming for continuous multi-criteria optimization to the target decision rule for mixed uncertain problems. Entropy, 24(1). https://doi.org/10.3390/e24010051

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free