搜索结果: 1-6 共查到“信息科学与系统科学 D-optimality”相关记录6条 . 查询时间(0.046 秒)
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, ...
In this paper, we derive an exact penalty function for nonconvex bilevel programming problem based on its KS form. Based on this exact penalty function a sufficient condition for KS to be partially c...
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 OPTIMALITY CONDITIONS OF D-PSEUDOCONVEX PROGRAMMING WITH OPERATOR CONSTRAINTS
D-pseudoconvex programming operator cons
2007/8/7
The problem of D-pseudoconvex programming with operator constraints is discussed in this paper. Some new optimality conditions are presented and an error made by V. Barbu in [4] is pointed out.
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...