• 제목/요약/키워드: the duality

검색결과 524건 처리시간 0.025초

SYMMETRIC DUALITY FOR FRACTIONAL VARIATIONAL PROBLEMS WITH CONE CONSTRAINTS

  • Ahmad, I.;Yaqub, Mohd.;Ahmed, A.
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.281-292
    • /
    • 2007
  • A pair of symmetric fractional variational programming problems is formulated over cones. Weak, strong, converse and self duality theorems are discussed under pseudoinvexity. Static symmetric dual fractional programs are included as special case and corresponding symmetric duality results are merely stated.

MODEL STRUCTURES AND RECOLLEMENTS INDUCED BY DUALITY PAIRS

  • Wenjing Chen;Ling Li;Yanping Rao
    • 대한수학회보
    • /
    • 제60권2호
    • /
    • pp.405-423
    • /
    • 2023
  • Let (𝓛, 𝒜) be a complete duality pair. We give some equivalent characterizations of Gorenstein (𝓛, 𝒜)-projective modules and construct some model structures associated to duality pairs and Frobenius pairs. Some rings are described by Frobenius pairs. In addition, we investigate special Gorenstein (𝓛, 𝒜)-projective modules and construct some model structures and recollements associated to them.

ON DUALITY THEOREMS FOR MULTIOBJECTIVE PROGRAMS

  • Kim, Do-Sang;Lee, Gue-Myung
    • East Asian mathematical journal
    • /
    • 제5권2호
    • /
    • pp.209-213
    • /
    • 1989
  • The efficiency(Pareto optimum) is a type of solutions for multiobjective programs. We formulate duality relations for multiobjective nonlinear programs by using the concept of efficiency. The results are the weak and strong duality relations for a vector dual of the Wolfe type involving invex functions.

  • PDF

과정-대상 측면에서 본 '대수적 사고' 연구 (A study on the a1gebraic thinking - From the perspective of 'process' and 'object' aspects -)

  • 김성준
    • 대한수학교육학회지:수학교육학연구
    • /
    • 제12권4호
    • /
    • pp.457-472
    • /
    • 2002
  • In this paper, we deal with the algebraic thinking from the perspective of ‘process’ and ‘object’ aspects. Generally, mathematical concepts have come from the concrete process. We consider the origin of algebra as the arithmetic calculations. Also, the concept of school arithmetic is beginning from actions or procedures. However, in order to develop the alge- braic thinking and to apply this thinking, we have to see the history of algebraic thinking, and find this duality. Next we investigate various researches relating to the ‘process-object duality’. Theses studies suppose that the concept formation and thinking process should be stared from the process-object duality. Finally, we reinterprete many difficulties in algebra - equals sign, variables, algebraic expressions, and linear equations, the principle of permanence of form- from the perspective of the process-object duality.

  • PDF

SADDLE POINT AND GENERALIZED CONVEX DUALITY FOR MULTIOBJECTIVE PROGRAMMING

  • Yan, Zhao-Xiang;Li, Shi-Zheng
    • Journal of applied mathematics & informatics
    • /
    • 제15권1_2호
    • /
    • pp.227-235
    • /
    • 2004
  • In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

DUALITY FOR MULTIOBJECTIVE FRACTIONAL CONTROL PROBLEMS WITH GENERALIZED INVEXITY

  • Nahak, C.;Nanda, S.
    • Journal of applied mathematics & informatics
    • /
    • 제5권2호
    • /
    • pp.475-488
    • /
    • 1998
  • Wolfe and Mond-Weir type duals for multiobjective con-trol problems are formulated. Under pseudo-invexity/quasi-invexity assumptions of the functions involved, weak and strong duality the-orems are proved to relate efficient solutions of the primal and dual problems.

OPTIMALITY CONDITIONS AND DUALITY IN NONDIFFERENTIABLE ROBUST OPTIMIZATION PROBLEMS

  • Kim, Moon Hee
    • East Asian mathematical journal
    • /
    • 제31권3호
    • /
    • pp.371-377
    • /
    • 2015
  • We consider a nondifferentiable robust optimization problem, which has a maximum function of continuously differentiable functions and support functions as its objective function, continuously differentiable functions as its constraint functions. We prove optimality conditions for the nondifferentiable robust optimization problem. We formulate a Wolfe type dual problem for the nondifferentiable robust optimization problem and prove duality theorems.

Duality in an Optimal Harvesting Problem by a Nonlinear Age-Spatial Structured Population Dynamic System

  • Kim, Yong-Kuk;Lee, Mi-Jin;Jung, Il-Hyo
    • Kyungpook Mathematical Journal
    • /
    • 제51권4호
    • /
    • pp.353-364
    • /
    • 2011
  • Duality in the optimal harvesting for a nonlinear age-spatial structured population dynamic model is studied in the framework of optimal control problem. In this paper the duality theory that displays the conjugacy of the primal problem is established and an application is given. Duality theory plays an important role in both optimization theory and methodology and the results may be applied to a realistic biological system on the point of optimal harvesting.