A Better Approach for Solving a Fuzzy Multiobjective Programming Problem by Level Sets

In this paper, we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions.

A Better Approach for Solving a Fuzzy Multiobjective Programming Problem by Level Sets

In this paper we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions.

Some Approaches for Fuzzy Multiobjective Programming Problems

In this paper we discuss two approaches to bring a balance between effectiveness and efficiency while solving a multiobjective programming problem with fuzzy objective functions. To convert the original fuzzy optimization problem into deterministic terms, the first approach makes use of the Nearest Interval Approximation Operator (Approximation approach) for fuzzy numbers and the second one takes advantage of an Embedding Theorem for fuzzy numbers (Equivalence approach). The resulting optimization problem related to the first approach is handled via Karush- Kuhn-Tucker like conditions for Pareto Optimality obtained for the resulting interval optimization problem. A Galerkin like scheme is used to tackle the deterministic counterpart associated to the second approach. Our approaches enable both faithful representation of reality and computational tractability. They are thus in sharp contrast with many existing methods that are either effective or efficient but not both. Numerical examples are also supplemented for the sake of illustration.

Evolutionary algorithm using surrogate models for solving bilevel multiobjective programming problems

A bilevel programming problem with multiple objectives at the leader’s and/or follower’s levels, known as a bilevel multiobjective programming problem (BMPP), is extraordinarily hard as this problem accumulates the computational complexity of both hierarchical structures and multiobjective optimisation. As a strongly NP-hard problem, the BMPP incurs a significant computational cost in obtaining non-dominated solutions at both levels, and few studies have addressed this issue. In this study, an evolutionary algorithm is developed using surrogate optimisation models to solve such problems. First, a dynamic weighted sum method is adopted to address the follower’s multiple objective cases, in which the follower’s problem is categorised into several single-objective ones. Next, for each the leader’s variable values, the optimal solutions to the transformed follower’s programs can be approximated by adaptively improved surrogate models instead of solving the follower’s problems. Finally, these techniques are embedded in MOEA/D, by which the leader’s non-dominated solutions can be obtained. In addition, a heuristic crossover operator is designed using gradient information in the evolutionary procedure. The proposed algorithm is executed on some computational examples including linear and nonlinear cases, and the simulation results demonstrate the efficiency of the approach.

Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem

This note is devoted to the investigation of optimality conditions for robust approximate quasi weak efficient solutions to a nonsmooth uncertain multiobjective programming problem (NUMP). Firstly, under the extended nonsmooth Mangasarian–Fromovitz constrained qualification assumption, the optimality necessary conditions of robust approximate quasi weak efficient solutions are given by using an alternative theorem. Secondly, a class of generalized convex functions is introduced to the problem (NUMP), which is called the pseudoquasi-type-I function, and its existence is illustrated by a concrete example. Finally, under the pseudopseudo-type-I generalized convexity hypothesis, the optimality sufficient conditions for robust approximate quasi weak efficient solutions to the problem (NUMP) are established.

Nondifferentiable Multiobjective Programming Problem under Strongly K-Gf-Pseudoinvexity Assumptions

In this paper we consider the introduction of the concept of (strongly) K- G f -pseudoinvex functions which enable to study a pair of nondifferentiable K-G- Mond-Weir type symmetric multiobjective programming model under such assumptions.

Symmetric duality results for second-order nondifferentiable multiobjective programming problem

In this article, we study the existence of Gf-bonvex/Gf -pseudo-bonvex functions and construct various nontrivial numerical examples for the existence of such type of functions. Furthermore, we formulate Mond-Weir type second-order nondifferentiable multiobjective programming problem and give a nontrivial concrete example which justify weak duality theorem present in the paper. Next, we prove appropriate duality relations under aforesaid assumptions.