• Title/Summary/Keyword: Duality

Search Result 529, Processing Time 0.022 seconds

OPTIMALITY CRITERIA AND DUALITY FOR MULTIOBJECTIVE VARIATIONAL PROBLEMS INVOLVING HIGHER ORDER DERIVATIVES

  • Husain, I.;Ahmed, A.;Rumana, G. Mattoo
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.123-137
    • /
    • 2009
  • A multiobjective variational problem involving higher order derivatives is considered and Fritz-John and Karush-Kuhn-Tucker type optimality conditions for this problem are derived. As an application of Karush-Kuhn-Tucker optimality conditions, Wolfe type dual to this variational problem is constructed and various duality results are validated under generalized invexity. Some special cases are mentioned and it is also pointed out that our results can be considered as a dynamic generalization of the already existing results in nonlinear programming.

  • PDF

SPECTRAL DUALITIES OF MV-ALGEBRAS

  • Choe, Tae-Ho;Kim, Eun-Sup;Park, Young-Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.42 no.6
    • /
    • pp.1111-1120
    • /
    • 2005
  • Hong and Nel in [8] obtained a number of spectral dualities between a cartesian closed topological category X and a category of algebras of suitable type in X in accordance with the original formalism of Porst and Wischnewsky[12]. In this paper, there arises a dual adjointness S $\vdash$ C between the category X = Lim of limit spaces and that A of MV-algebras in X. We firstly show that the spectral duality: $S(A)^{op}{\simeq}C(X^{op})$ holds for the dualizing object K = I = [0,1] or K = 2 = {0, 1}. Secondly, we study a duality between the category of Tychonoff spaces and the category of semi-simple MV-algebras. Furthermore, it is shown that for any $X\;\in\;Lim\;(X\;{\neq}\;{\emptyset})\;C(X,\;I)$ is densely embedded into a cube $I^/H/$, where H is a set.

A REMARK ON GEL'FAND DUALITY FOR SPECTRAL TRIPLES

  • Bertozzini, Paolo;Conti, Roberto;Lewkeeratiyutkul, Wicharn
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.3
    • /
    • pp.505-521
    • /
    • 2011
  • We present a duality between the category of compact Riemannian spin manifolds (equipped with a given spin bundle and charge conjugation) with isometries as morphisms and a suitable "metric" category of spectral triples over commutative pre-$C^*$-algebras. We also construct an embedding of a "quotient" of the category of spectral triples introduced in [5] into the latter metric category. Finally we discuss a further related duality in the case of orientation and spin-preserving maps between manifolds of fixed dimension.

ON SUFFICIENCY AND DUALITY IN MULTIOBJECTIVE SUBSET PROGRAMMING PROBLEMS INVOLVING GENERALIZED $d$-TYPE I UNIVEX FUNCTIONS

  • Jayswal, Anurag;Stancu-Minasian, I.M.
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.111-125
    • /
    • 2012
  • In this paper, we introduce new classes of generalized convex n-set functions called $d$-weak strictly pseudo-quasi type-I univex, $d$-strong pseudo-quasi type-I univex and $d$-weak strictly pseudo type-I univex functions and focus our study on multiobjective subset programming problem. Sufficient optimality conditions are obtained under the assumptions of aforesaid functions. Duality results are also established for Mond-Weir and general Mond-Weir type dual problems in which the involved functions satisfy appropriate generalized $d$-type-I univexity conditions.

OPTIMALITY AND DUALITY IN NONDIFFERENTIABLE MULTIOBJECTIVE FRACTIONAL PROGRAMMING USING α-UNIVEXITY

  • Gupta, Rekha;Srivastava, Manjari
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.359-375
    • /
    • 2014
  • In this paper, a multiobjective nondifferentiable fractional programming problem (MFP) is considered where the objective function contains a term involving the support function of a compact convex set. A vector valued (generalized) ${\alpha}$-univex function is defined to extend the concept of a real valued (generalized) ${\alpha}$-univex function. Using these functions, sufficient optimality criteria are obtained for a feasible solution of (MFP) to be an efficient or weakly efficient solution of (MFP). Duality results are obtained for a Mond-Weir type dual under (generalized) ${\alpha}$-univexity assumptions.

MULTIOBJECTIVE SECOND-ORDER NONDIFFERENTIABLE SYMMETRIC DUALITY INVOLVING (F, $\alpha$, $\rho$, d)-CONVEX FUNCTIONS

  • Gupta, S.K.;Kailey, N.;Sharma, M.K.
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1395-1408
    • /
    • 2010
  • In this paper, a pair of Wolfe type second-order nondifferentiable multiobjective symmetric dual program over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under second-order (F, $\alpha$, $\rho$, d)-convexity assumptions. An illustration is given to show that second-order (F, $\alpha$, $\rho$, d)-convex functions are generalization of second-order F-convex functions. Several known results including many recent works are obtained as special cases.

OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS

  • Jaiswal, Monika;Mishra, Shashi Kant;Al Shamary, Bader
    • Communications of the Korean Mathematical Society
    • /
    • v.27 no.2
    • /
    • pp.411-423
    • /
    • 2012
  • A nondifferentiable nonlinear semi-infinite programming problem is considered, where the functions involved are ${\eta}$-semidifferentiable type I-preinvex and related functions. Necessary and sufficient optimality conditions are obtained for a nondifferentiable nonlinear semi-in nite programming problem. Also, a Mond-Weir type dual and a general Mond-Weir type dual are formulated for the nondifferentiable semi-infinite programming problem and usual duality results are proved using the concepts of generalized semilocally type I-preinvex and related functions.

(𝓕, 𝓐)-GORENSTEIN FLAT HOMOLOGICAL DIMENSIONS

  • Becerril, Victor
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.6
    • /
    • pp.1203-1227
    • /
    • 2022
  • In this paper we develop the homological properties of the Gorenstein (𝓛, 𝓐)-flat R-modules 𝓖𝓕(𝓕(R),𝓐) proposed by Gillespie, where the class 𝓐 ⊆ Mod(Rop) sometimes corresponds to a duality pair (𝓛, 𝓐). We study the weak global and finitistic dimensions that come with the class 𝓖𝓕(𝓕(R),𝓐) and show that over a (𝓛, 𝓐)-Gorenstein ring, the functor - ⊗R - is left balanced over Mod(Rop) × Mod(R) by the classes 𝓖𝓕(𝓕(Rop),𝓐) × 𝓖𝓕(𝓕(R),𝓐). When the duality pair is (𝓕(R), 𝓕𝓟Inj(Rop)) we recover the G. Yang's result over a Ding-Chen ring, and we see that is new for (Lev(R), AC(Rop)) among others.

Distributed Throughput-Maximization Using the Up- and Downlink Duality in Wireless Networks (무선망에서의 상하향 링크 쌍대성 성질을 활용한 분산적 수율 최대화 기법)

  • Park, Jung-Min;Kim, Seong-Lyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.878-891
    • /
    • 2011
  • We consider the throughput-maximization problem for both the up- and downlink in a wireless network with interference channels. For this purpose, we design an iterative and distributive uplink algorithm based on Lagrangian relaxation. Using the uplink power prices and network duality, we achieve throughput-maximization in the dual downlink that has a symmetric channel and an equal power budget compared to the uplink. The network duality we prove here is a generalized version of previous research [10], [11]. Computational tests show that the performance of the up- and downlink throughput for our algorithms is close to the optimal value for the channel orthogonality factor, ${\theta}{\in}$(0.5, 1]. On the other hand, when the channels are slightly orthogonal (${\theta}{\in}$(0, 0.5]), we observe some throughput degradation in the downlink. We have extended our analysis to the real downlink that has a nonsymmetric channel and an unequal power budget compared to the uplink. It is shown that the modified duality-based approach is thoroughly applied to the real downlink. Considering the complexity of the algorithms in [6] and [18], we conclude that these results are quite encouraging in terms of both performance and practical applicability of the generalized duality theorem.

A NEW CLASS OF GENERALIZED CONVEX PROGRAMMING

  • YAN ZHAOXIANG;LI SHIZHENG
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.351-360
    • /
    • 2005
  • This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.