搜索结果: 1-9 共查到“理学 Multiobjective programming”相关记录9条 . 查询时间(0.072 秒)
OPTIMALITY CONDITIONS AND DUALITY THEOREMS IN NONCONICAL MULTIOBJECTIVE PROGRAMMING
Multiobjective programming nonconical o
2007/12/17
摘要 This paper is concerned with the nonconical multiobjective programming proly fern. By virtue of the derivate of a binary relation, the sufficient and necessary optimality conditions are presented, ...
Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming
Multiobjective programming cone-efficient solution cone-quasiconvex mapping generalized saddle theorem connectedness
2007/12/11
This paper deals with the connectedness of thecone-efficient solution set for vector optimization in locallyconvex Hausdorff topological vector spaces.The connectedness of thecone-efficient solution s...
NECESSARY CONDITIONS FOR MAJOR OPTIMAL SOLUTIONS AND MAJOR EFFICIENT SOLUTIONS OF MULTIOBJECTIVE PROGRAMMING
Multiobjective programming major optima
2007/12/10
摘要 In this papers the Fritz John conditions and Kuhn-Tucker conditions for majoroptimal solutions and major efficient solutions of multiobjective programming are givenand proved.
Major efficiency is an efficiency theory of multiobjective programming, whichis based on the law of majority. For the case that the feasible region is a finite set, paper [3] gave a comparison-number ...
USING DISPLACED CONE REPRESENTATION IN DEA MODELS FOR NONDOMINATED SOLUTIONS IN MULTIOBJECTIVE PROGRAMMING
Multi-objective programming efficiency
2007/8/7
Concepts revolving around "displaced cones" are used to extend the ideas of nondominated solutions in multiobjective programming. Necessary and sufficient conditions are formed around the additive mod...
NONCONICAL N0NSMOOTH MULTIOBJECTIVE PROGRAMMING-OPTIMALITY CONDITIONS AND DUALITY THEOREMS
Binary relation generalized directional
2007/8/7
This paper deals with Nonconical Nonsmooth Multiobjective Programming Problem. The generalized directional derivate of a mapping w.r.t a binary relation and the derivate of a binary relation are intro...
OPTIMALITY CONDITIONS IN NONSMOOTH MULTIOBJECTIVE PROGRAMMING
multiobjective programming generalized
2007/8/7
In this paper, a separation theorem is established firstly. Applying this theorem the relationships between the solutions of a series of inequality systems are discussed. Then a necessary optimality c...
THE COMPARISON-NUMBER METHOD FOR FINDING MAJOR OPTIMAL SOLUTIONS AND MAJOR EFFICIENT SOLUTIONS OF THE DISCRETE MULTIOBJECTIVE PROGRAMMING
Multiobjective programming Pareto effici
2007/8/7
In this paper, we introduce the comparison number for one feasible solutioncompared with another. With the help of it the comparison-number method for finding the major optimal solutions aud major eff...
In this paper we discuss necessary conditions in multiobjective differentiable programming. We first give a counterexample to [1,Theorem 2.1] and then present its correct form with which we can easily...