Biofuel production from agricultural waste has been identified as a promising strategy in the field of renewable energy. This topic involves complex mathematical modeling tasks such as feedstock characteristics, biore...
详细信息
Biofuel production from agricultural waste has been identified as a promising strategy in the field of renewable energy. This topic involves complex mathematical modeling tasks such as feedstock characteristics, biorefinery location, capacity strategy and material flows. This paper proposes a Multiple Objective Mixed Integer Linear programming model (MOMILP) for the design of a sustainable supply chain using multiple agricultural residues. The proposed comprehensive model is utilized in a case study in Colombia, using coffee crop residues. Computational results show the model's robustness as a decision-making tool, which allows the projection of a flexible supply chain structure in the long term.
In this paper, we study the necessary optimality conditions for local Pareto and local weak Pareto solutions of multiobjective problems (MOPs) involving inequality and equality constraints. In this regard, the approxi...
详细信息
In this paper, we study the necessary optimality conditions for local Pareto and local weak Pareto solutions of multiobjective problems (MOPs) involving inequality and equality constraints. In this regard, the approximate Karush-Kuhn-Tucker conditions for MOPs are introduced and several constraint qualifications are also presented. Moreover, some illustrative examples are provided to clarify our results.
Analyzing the behavior and stability properties of a local optimum in an optimization problem, when small perturbations are added to the objective functions, are important considerations in optimization. The tilt stab...
详细信息
Analyzing the behavior and stability properties of a local optimum in an optimization problem, when small perturbations are added to the objective functions, are important considerations in optimization. The tilt stability of a local minimum in a scalar optimization problem is a well-studied concept in optimization which is a version of the Lipschitzian stability condition for a local minimum. In this paper, we define a new concept of stability pertinent to the study of multiobjective optimization problems. We prove that our new concept of stability is equivalent to tilt stability when scalar optimizations are available. We then use our new notions of stability to establish new necessary and sufficient conditions on when strict locally efficient solutions of a multiobjective optimization problem will have small changes when correspondingly small perturbations are added to the objective functions.
The presented study deals with the scalarization techniques for solving multiobjective optimization problems. The Pascoletti-Serafini scalarization technique is considered, and it is attempted to sidestep two weakness...
详细信息
The presented study deals with the scalarization techniques for solving multiobjective optimization problems. The Pascoletti-Serafini scalarization technique is considered, and it is attempted to sidestep two weaknesses of this method, namely the inflexibility of the constraints and the difficulties of checking proper efficiency. To this end, two modifications for the Pascoletti-Serafini scalarization technique are proposed. First, by including surplus variables in the constraints and penalizing the violations in the objective function, the inflexibility of the constraints is resolved. Moreover, by including slack variables in the constraints, easy-to-check statements on proper efficiency are obtained. Thereafter, the two proposed modifications are combined to obtain the revised Pascoletti-Serafini scalarization method. Theorems are provided on the relation of (weakly, properly) efficient solutions of the multiobjective optimization problem and optimal solutions of the proposed scalarized problems. All the provided results are established with no convexity assumption. Moreover, the capability of the proposed approaches is demonstrated through numerical examples.
New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebr...
详细信息
New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.
The concepts of (Φ, ρ)-invexity have been given by Caristi, Ferrara and Stefanescu[32]. We consider a higher-order dual model associated to a multiobjective programming problem involving support functions and a weak...
详细信息
The concepts of (Φ, ρ)-invexity have been given by Caristi, Ferrara and Stefanescu[32]. We consider a higher-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate higher-order (Φ, ρ)-invexity conditions.
We state the Abadie constraint qualification for multiobjective optimization problems involving inequality, equality constraints and a closed abstract set constraint and derive the necessary optimality conditions at w...
详细信息
We state the Abadie constraint qualification for multiobjective optimization problems involving inequality, equality constraints and a closed abstract set constraint and derive the necessary optimality conditions at weak Pareto optimal solutions based on the limiting subdifferential. In contrast to the most developed works on multiobjective problems, this constraint qualification entirely depends on the feasible set. Moreover, the relationship between the Abadie constraint qualification and the local error bound condition is studied. Finally some examples are provided to clarify our results.
Comprehensive quality evaluation is the measure of the members' comprehensive ability and the premise and foundation of improving the team's operation efficiency. How to accurately obtain the comprehensive qua...
详细信息
ISBN:
(纸本)9781728128177
Comprehensive quality evaluation is the measure of the members' comprehensive ability and the premise and foundation of improving the team's operation efficiency. How to accurately obtain the comprehensive quality of members has been a widely concerned issue in the academic and application fields. Taking cooperative performance as the main observation index, this paper proposes a comprehensive quality evaluation model based on cooperative performance, and analyzes the characteristics and shortcomings of this model. In order to solve the problem that the solution cannot be guaranteed, the method of multi objective programming is applied to give the solution strategy based on the deviation variable. Finally, the feasibility and effectiveness of the model are analyzed with a case study. Theoretical analysis and example calculation show that the model has good interpretability and operability, which not only improves the existing evaluation methods to a certain extent, but also has wide application value in the fields of resource allocation, artificial intelligence and recommendation system.
We present a proximal point method to solve multiobjective programming problems based on the scalarization for maps. We build a family of convex scalar strict representations of a convex map F from R(n) to R(m) with r...
详细信息
We present a proximal point method to solve multiobjective programming problems based on the scalarization for maps. We build a family of convex scalar strict representations of a convex map F from R(n) to R(m) with respect to the lexicographic order on R(m) and we add a variant of the logarithmic-quadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced in the quadratic term. The nonegative variables employed in the scalarization are placed in the logarithmic term. We show that the central trajectory of the scalarized problem is bounded and converges to a weak pareto solution of the multiobjective optimization problem.
The concept of equitability in multiobjective programming is generalized within a framework of convex cones. Two models are presented. First, more general polyhedral cones are assumed so determine the equitable prefer...
详细信息
The concept of equitability in multiobjective programming is generalized within a framework of convex cones. Two models are presented. First, more general polyhedral cones are assumed so determine the equitable preference. Second, the Pareto cone appearing in the monotonicity axiom of equitability is replaced with a permutation-invariant polyhedral cone. The conditions under which the new models are related and satisfy original and modified axioms of the equitable preference are developed. Relationships between generalized equitability and relative importance of criteria and stochastic dominance are revealed. (C) 2011 Elsevier B.V. All rights reserved.
暂无评论