• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.139-152
• /
• 2003

In this paper, we characterize a vector-valued convex set function by its epigraph. The concepts of a vector-valued set function and a vector-valued concave set function we given respectively. The definitions of the conjugate functions for a vector-valued convex set function and a vector-valued concave set function are introduced. Then a Fenchel duality theorem in multiobjective programming problem with set functions is derived.

• Communications of the Korean Mathematical Society
• /
• v.25 no.3
• /
• pp.373-383
• /
• 2010

In this paper, we prove that $(\Gamma(x))^{\frac{1}{x-1}}$ is geometrically convex on (0, $\infty$). As its applications, we obtain some new estimates for $\frac{[\Gamma(x+1)]^{\frac{1}{x}}} {[\Gamma(y+1)]^{\frac{1}{y}}}$.

• Communications of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.163-178
• /
• 2023

We use the theory of differential subordination to explore various inequalities that are satisfied by an analytic function p defined on the unit disc so that the function p is subordinate to the function e^z. These results are applied to find sufficient conditions for the normalised analytic functions f defined on the unit disc to satisfy the subordination zf'(z)/f(z) ≺ e^z.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3E
• /
• pp.37-43
• /
• 1999

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.587-599
• /
• 1996

We assume throughout the paper that f(z) is a conformal function in the ipen unit disk $D = {z : $\mid$z$\mid$ < 1}$. In the rest of paper, conformal means analytic and locally univalent.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.119-125
• /
• 2015

In this note, two new mappings associated with convexity are propoesd, by which we obtain some new Hermite-Hadamard type inequalities for convex functions via Riemann-Liouville fractional integrals. We conclude that the results obtained in this work are the refinements of the earlier results.

• East Asian mathematical journal
• /
• v.19 no.2
• /
• pp.165-171
• /
• 2003

We show that any F-harmonic map from a compact manifold M to N is necessarily constant if N possesses a strictly-convex function, and prove 'Liouville type theorems' for F-harmonic maps. Finally, when the target manifold is the real line, we get a result for F-subharmonic functions.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.845-859
• /
• 2016

In this paper, some Hermite-Hadamard-$Fej{\acute{e}}r$ type integral inequalities for harmonically quasi-convex functions in fractional integral forms have been obtained.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.58-65
• /
• 2002

When we estimate the optimal solution satisfy the objective function and subjective equation in the integer programming, The optimal solution of the objective function Z is decided by the positive integer at extreme point or revised extreme point in the convex set. The convex set is made up the linear subjective equation. The purpose of the paper is thus to establish a stepwise optimization in the integer programming model by estimating the variation △C/sub j/ of the constant term C/sub j/ in the linear objective function, after an application of the modified Branch & Bound method.

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.53-64
• /
• 2016

In this paper, we give generalization of the $Fej\acute{e}r$-Hadamard inequality by using definition of convex functions on n-coordinates. Results given in [8, 12] are particular cases of results given here.