In this paper, we give an application of UV-decomposition method of convex programming to multiobjective programming, and offer a new algorithm for solving semi-infinite multiobjective programming. Finally, the superl...
详细信息
In this paper, we give an application of UV-decomposition method of convex programming to multiobjective programming, and offer a new algorithm for solving semi-infinite multiobjective programming. Finally, the superlinear convergence of the algorithm is proved.
In this study, we established appropriate duality results for a pair of Wolfe and Mond-Weir type symmetric dual for nonlinear programming problems in complex spaces under second order F-univexity, Funicavity/ F-pseudo...
详细信息
In this study, we established appropriate duality results for a pair of Wolfe and Mond-Weir type symmetric dual for nonlinear programming problems in complex spaces under second order F-univexity, Funicavity/ F-pseudounivexity, F-pseudounicavity . Results of this paper are real extension of previous literature.
The aim of this paper is to investigate several inherited properties of convexity for set-valued maps and develop computational procedure based on such inherited properties. In this paper, we introduced two types of c...
详细信息
The aim of this paper is to investigate several inherited properties of convexity for set-valued maps and develop computational procedure based on such inherited properties. In this paper, we introduced two types of characteristic functions by using Tchebyshev scalarization, and defined four types of scalarization functions to characterize the images of set-valued maps.
Transshipment is a critical area of supply chain management that may lead to cost reductions and improved services for companies to make greater profits and to become more competitive. In this study, we present a tran...
详细信息
Transshipment is a critical area of supply chain management that may lead to cost reductions and improved services for companies to make greater profits and to become more competitive. In this study, we present a transshipment planning model for the petroleum refinery industry. The main objective of the model is to minimize the total transshipment cost, maximize production, satisfy storage requirements at depots and meet the demand for oil in these sales areas. To accommodate imprecision, the goals are defined in a fuzzy sense and a fuzzy goal programming (FGP) model is developed. To provide flexibility to the decision-maker, we integrate a genetic algorithm (GA) within the FGP framework in such a way that it can find solutions for different sets of target and tolerance values of the goals in a single run. A case example is presented to demonstrate the usefulness of the integrated technique. (C) 2009 Elsevier B.V. All rights reserved.
A linear programming model is introduced to solve cooperative games. The solution is always Pareto optimal. it is based on the idea of the core but instead of requiring rationality for all groups, a multiobjective app...
详细信息
A linear programming model is introduced to solve cooperative games. The solution is always Pareto optimal. it is based on the idea of the core but instead of requiring rationality for all groups, a multiobjective approach is proposed including the importance weights of the players. A case study illustrates the application of this method. (C) 2009 Elsevier Ltd. All rights reserved.
We formulate and study a multiobjective programming approach for production processes which implements suitable constraints on pollutant emissions. We consider two alternative optimization problems: (a) minimum pollut...
详细信息
We formulate and study a multiobjective programming approach for production processes which implements suitable constraints on pollutant emissions. We consider two alternative optimization problems: (a) minimum pollution risk;(b) maximum expected return. For each pollutant, we define three different contamination levels: (a) the desirable or the target pollution level, (b) the alarm (warning or critical) level and (c) the maximum admissible (acceptable) level, and introduce penalties proportional to the amounts of pollutants that exceed these levels. The objective function of the minimum pollution risk problem is not smooth since it contains positive parts of some affine functions, resulting in mathematical difficulties, which can be solved by formulating an alternative linear programming model, which makes use of additional variables and has the same solutions as the initial problem. We investigate various particular cases and analyze a numerical example for a textile plant. (C) 2007 Elsevier B.V. All rights reserved.
A nonsmooth multiobjective continuous-time problem is considered. The definition of invexity and its generalizations for continuous-time functions are extended. Then, optimality conditions under generalized invexity a...
详细信息
A nonsmooth multiobjective continuous-time problem is considered. The definition of invexity and its generalizations for continuous-time functions are extended. Then, optimality conditions under generalized invexity assumptions are established. Subsequently, these optimality conditions are utilized as a basis for formulating dual problems. Duality results are also obtained for Wolfe as well as Mond-Weir type dual, using generalized invexity on the functions involved.
We propose an extension of Newton's method for unconstrained multiobjective optimization (multicriteria optimization). This method does not use a priori chosen weighting factors or any other form of a priori ranki...
详细信息
We propose an extension of Newton's method for unconstrained multiobjective optimization (multicriteria optimization). This method does not use a priori chosen weighting factors or any other form of a priori ranking or ordering information for the different objective functions. Newton's direction at each iterate is obtained by minimizing the max-ordering scalarization of the variations on the quadratic approximations of the objective functions. The objective functions are assumed to be twice continuously differentiable and locally strongly convex. Under these hypotheses, the method, as in the classical case, is locally superlinear convergent to optimal points. Again as in the scalar case, if the second derivatives are Lipschitz continuous, the rate of convergence is quadratic. Our convergence analysis uses a Kantorovich-like technique. As a byproduct, existence of optima is obtained under semilocal assumptions.
We study a multiobjective problem with a feasible set defined by equality and inequality constraints. Then, by using the concept of K-directional derivative, we prove general optimality conditions as well as results c...
详细信息
We study a multiobjective problem with a feasible set defined by equality and inequality constraints. Then, by using the concept of K-directional derivative, we prove general optimality conditions as well as results concerning duality theorems.
A pair of Mond-Weir type nondifferentiable multiobjective second order symmetric dual programs is formulated and symmetric duality theorems are established under the assumptions of second order F-pseudoconvexity/F-pse...
详细信息
A pair of Mond-Weir type nondifferentiable multiobjective second order symmetric dual programs is formulated and symmetric duality theorems are established under the assumptions of second order F-pseudoconvexity/F-pseudoconcavity. (c) 2005 Elsevier Ltd. All rights reserved.
暂无评论