The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantee to generate all proper efficient solutions and does not require any kind of cenvexity or boundedness conditions. In addition the preference and reference point information of the decision maker is taken into consideretion by this method. Also in this paper,...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

Abstract This work deals with the efficient numerical characterization of Pareto stationary fronts for multiobjective optimal control problems a moderate number cost functionals and mildly nonsmooth, elliptic, semilinear PDE-constraint. When “ample” controls are considered, strong stationarity conditions that can be used to numerically characterize known our problem. We show finite dimensional ...

Multiple Criteria decision-making (MCDM) approaches are required for complex issue resolution. However, it is debatable whether MCDMs applicability will be able to stay within the analytical possibilities dealing with divorce issues. As a result, one of newly introduced Weighted aggregated sum product assessment (WASPAS), chosen evaluation. Therefore, this study examined 388 documents from arch...

in this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. for finding the efficient points in purposed molp problem, some various methods like lexicography & the weighted sum can be used. so by introducing the molp problem the cost & income efficiencies will be achieved. in the present study, the molp problem ...

In decision-theoretic planning problems, such as (partially observable) Markov decision problems [Wiering and Van Otterlo, 2012] or coordination graphs [Guestrin et al., 2002], agents typically aim to optimize a scalar value function. However, in many real-world problems agents are faced with multiple possibly conflicting objectives, e.g., maximizing the economic benefits of timber harvesting w...

Abstract Scalarization is a common technique to transform multiobjective optimization problem into scalar-valued problem. This article deals with the weighted Tchebycheff scalarization applied discrete problems. consists of minimizing maximum distance image feasible solution some desirable reference point. By choosing suitable weight, any Pareto optimal can be obtained. In this article, we prov...

This study discusses some variants of Ordered WeightedAveraging (OWA) operators and related information aggregation methods. Indetail, we define the Extended Ordered Weighted Sum (EOWS) operator and theExtended Ordered Weighted Averaging (EOWA) operator, which are applied inscientometrics evaluation where the preference is over finitely manyrepresentative works. As...