共查询到20条相似文献,搜索用时 78 毫秒
1.
研究一类多目标分式规划的二阶对称对偶问题.在二阶F-凸性假设下给出了对偶问题的弱对偶、强对偶和逆对偶定理.并在对称和反对称假设下研究了该问题的自身对偶性. 相似文献
2.
3.
李元熹 《应用数学与计算数学学报》1993,7(2):61-70
本文给出了DC规划的直接对偶定理和逆对偶定理。作为特例,它们蕴涵了符号几何规划的对偶定理,最后给出一个数值例子来说明定理。1.引言 相似文献
4.
5.
6.
高英 《纯粹数学与应用数学》2014,(2):136-142
在锥约束非可微多目标优化问题Mond-Weir型高阶弱对偶定理的基础上,利用Fritz-John型必要条件,在没有任何约束品性条件下给出了逆对偶定理.最后,考虑了特殊情况,研究了单目标情况下对偶问题的逆对偶定理. 相似文献
7.
给出了一个不可微多目标分式变分问题,并利用有效性和真有效性概念,证明了在pseudo-invexity条件下与分式规划问题相关的弱对偶定理、强对偶定理及逆对偶定理. 相似文献
8.
9.
贾继红 《纯粹数学与应用数学》2008,24(2)
通过引入广义弧连通概念,在Rn空间中,研究极大极小非凸分式规划问题的最优性充分条件及其对偶问题.首先获得了极大极小非凸分式规划问题的最优性充分条件;然后建立分式规划问题的一个对偶模型并得到了弱对偶定理,强对偶定理和逆对偶定理. 相似文献
10.
11.
ZengRenying 《高校应用数学学报(英文版)》2000,15(2):220-224
Abstract. In this paper some optimality criteria are proved and some Mond-Weir type duality theorem for multiobjective fractional programming problems defined in a Banach space is obtained. 相似文献
12.
In this note a dual problem is formulated for a given class of disjunctive linear fractional programming problems. This result generalizes to fractional programming the duality theorem of disjunctive linear programming originated by Balas. Two examples are given to illustrate the result. 相似文献
13.
We show a Lagrange-type duality theorem for a DC programming problem, which is a generalization of previous results by J.-E. Martínez-Legaz, M. Volle [5] and Y. Fujiwara, D. Kuroiwa [1] when all constraint functions are real-valued. To the purpose, we decompose the DC programming problem into certain infinite convex programming problems. 相似文献
14.
本文建立了目标和约束为不对称的群体多目标最优化问题的Lagrange对偶规划,在问题的联合弱有效解意义下,得到群体多目标最优化Lagrange型的弱对偶定理、基本对偶定理、直接对偶定理和逆对偶定理。 相似文献
15.
群体多目标规划的联合Mond-Weir对偶 总被引:5,自引:0,他引:5
对于目标和约束均为不对称的群体多目标规划问题,本文研究它的联合有效解类 的Mond—Weir型对偶性,得到了相应的弱对偶定理、直接对偶定理和逆对偶定理. 相似文献
16.
《Optimization》2012,61(1):33-70
The class of continuous-time linear programming problems under the assumption that the constraints are satisfied almost everywhere in the time interval [0,?T]?is taken into account in this article. Under this assumption, its corresponding discretized problems cannot be formulated by equally dividing the time interval [0,?T]?as subintervals of [0,?T]?. In this article, we also introduce the perturbed continuous-time linear programming problems to prove the strong duality theorem when the constraints are assumed to be satisfied a.e. in [0,?T]?. 相似文献
17.
《Optimization》2012,61(9):2047-2048
This note is aimed to correct the strong duality theorem of previous paper regarding the continuous-time linear programming problems. The argument presented in the previous paper can only be used to prove the case of piecewise continuous functions in which the discontinuities are the left-continuities. 相似文献
18.
A note on duality in disjunctive programming 总被引:1,自引:0,他引:1
E. Balas 《Journal of Optimization Theory and Applications》1977,21(4):523-528
We state a duality theorem for disjunctive programming, which generalizes to this class of problems the corresponding result for linear programming.This work was supported by the National Science Foundation under Grant No. MPS73-08534 A02 and by the US Office of Naval Research under Contract No. N00014-75-C-0621-NR047-048. 相似文献
19.
S. Tanimoto 《Journal of Optimization Theory and Applications》1980,31(3):331-342
For a convex-concave functionL(x, y), we define the functionf(x) which is obtained by maximizingL with respect toy over a specified set. The minimization problem with objective functionf is considered. We derive necessary conditions of optimality for this problem. Based upon these necessary conditions, we define its dual problem. Furthermore, a duality theorem and a converse duality theorem are obtained. It is made clear that these results are extensions of those derived in studies on a class of nondifferentiable mathematical programming problems.This work was supported by the Japan Society for the Promotion of Sciences. 相似文献
20.
A Mond–Weir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer multiobjective programming problems is also presented. 相似文献