A special class of solutions for multiobjective programming problems with set functions is considered. A subset of nondominated solutions, called properD-solution set, with respect to a given domination structure is c...
详细信息
A special class of solutions for multiobjective programming problems with set functions is considered. A subset of nondominated solutions, called properD-solution set, with respect to a given domination structure is characterized under two situations, with and without inequality constraints.
In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse dual...
详细信息
In this paper, a pair of Mond-Weir type higher-order symmetric dual programs over arbitrary cones is formulated. The appropriate duality theorems, such as weak duality theorem, strong duality theorem and converse duality theorem, are established under higher-order （strongly） cone pseudoinvexity assumptions.
In this paper, we propose a linear programming based interactive method for multiobjective linear programmingproblems, in which fuzzy coefficients and random variable coefficients are involved in the objective functi...
详细信息
ISBN:
(纸本)9781479959556
In this paper, we propose a linear programming based interactive method for multiobjective linear programmingproblems, in which fuzzy coefficients and random variable coefficients are involved in the objective functions simultaneously. In the proposed method, it is assumed that the decision maker has a fuzzy goal for each objective function, and such a fuzzy goal can be quantified by eliciting the membership function. Through the possibility measure and a fractile optimization model, the original problem is transformed to the well-defined multiobjectiveprogramming problem. Then, a generalized Pareto optimal concept is defined, and a linear programming based interactive algorithm is proposed to obtain a satisfactory solution from among a generalized Pareto optimal solution set.
In this paper, (alpha, phi, Q)-invexity is introduced, where alpha: X x X --> int R+m, phi: X x X --> X, X is a Banach space, Q is a convex cone of R(m). This unifies the properties of many classes of functions,...
详细信息
In this paper, (alpha, phi, Q)-invexity is introduced, where alpha: X x X --> int R+m, phi: X x X --> X, X is a Banach space, Q is a convex cone of R(m). This unifies the properties of many classes of functions, such as Q-convexity, pseudo-linearity, representation condition, null space condition, and V-invexity. A generalized vector variational inequality is considered, and its equivalence with a multi-objective programming problem is discussed using (alpha, phi, Q)-invexity. An existence theorem for the solution of a generalized vector variational inequality is proved. Some applications of (alpha, phi, Q)-invexity to multi-objective programmingproblems and to a special kind of generalized vector variational inequality are given.
In recent years, researchers have investigated a variety of approaches to integrating lot sizing and cutting stock problems due to their high importance in the manufacturing industry. Although the mono-objective integ...
详细信息
In recent years, researchers have investigated a variety of approaches to integrating lot sizing and cutting stock problems due to their high importance in the manufacturing industry. Although the mono-objective integrated problem has been considered an excellent alternative for minimising global costs, it does not include all the multiple criteria involved in the manufacturing process. Thus, to address this issue, we use a multiobjective approach and explain its importance in providing various answers to the decision maker through the Pareto-optimal solution set. We analyse existing trade-offs and correlations between each cost of the integrated problem and the related decision variables. Several computational tests are performed, which validate the efficacy of our strategy.
In this paper, we present a combined homotopy interior-point method for a general multiobjectiveprogramming problem. The algorithm generated by this method associated to Karush-Kuhn-Tucker points of the multiobjectiv...
详细信息
In this paper, we present a combined homotopy interior-point method for a general multiobjectiveprogramming problem. The algorithm generated by this method associated to Karush-Kuhn-Tucker points of the multiobjectiveprogramming problem is proved to be globally convergent under some basic assumptions.
We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced an...
详细信息
We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items are not the same. We derive two mathematical models and formulate unconstrained and constrained optimization problems to optimize the holding cost. We also introduce the solution procedures of the proposed problems. The exactness of the proposed solutions has been tested by numerical experiments. Nowadays, it is an essential commitment for industries to reduce greenhouse gas (GHG) emissions as well as energy consumption during the production and remanufacturing processes. This paper also extends along this line of research, and therewith develops a three-objective mathematical model and provides an algorithm to obtain the Pareto solution. (c) 2022 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )
暂无评论