• International Journal of Computer Science & Network Security
• /
• 제24권1호
• /
• pp.85-94
• /
• 2024

In this paper, we present the very first time the generalized notion of (α, β, γ, δ) - convex (concave) function in mixed kind, which is the generalization of (α, β) - convex (concave) functions in 1^st and 2^nd kind, (s, r) - convex (concave) functions in mixed kind, s - convex (concave) functions in 1^st and 2^nd kind, p - convex (concave) functions, quasi convex(concave) functions and the class of convex (concave) functions. We would like to state the well-known Ostrowski inequality via SVN-Riemann Integrals for (α, β, γ, δ) - convex (concave) function in mixed kind. Moreover we establish some SVN-Ostrowski type inequalities for the class of functions whose derivatives in absolute values at certain powers are (α, β, γ, δ)-convex (concave) functions in mixed kind by using different techniques including Hölder's inequality and power mean inequality. Also, various established results would be captured as special cases with respect to convexity of function.

• 대한수학회지
• /
• 제47권2호
• /
• pp.373-383
• /
• 2010

New integral inequalities concerning $\gamma$-convex and $\gamma$-concave functions are presented.

• 대한수학회보
• /
• 제45권1호
• /
• pp.39-44
• /
• 2008

In this paper, we introduce the concepts of pre convexity neighborhoods, c-concave functions. We study some properties for c-convex functions, and characterize c-convex functions and c-concave functions by using the preconvexity neighborhoods.

• 호남수학학술지
• /
• 제29권4호
• /
• pp.589-595
• /
• 2007

In this paper, we introduce the concepts of the convexity hull and co-convex sets on preconvexity spaces. We study some properties for the co-convexity hull and characterize c-convex functions and c-concave functions by using the co-convexity hull and the convexity hull.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권3호
• /
• pp.229-235
• /
• 2005

The notions of spherically concave functions defined on a subregion of the Riemann sphere P are introduced in different ways in Kim & Minda [The hyperbolic metric and spherically convex regions. J. Math. Kyoto Univ. 41 (2001), 297-314] and Kim & Sugawa [Charaterizations of hyperbolically convex regions. J. Math. Anal. Appl. 309 (2005), 37-51]. We show continuity of the concave function defined in the latter and show that the two notions of the concavity are equivalent for a function of class $C^2$. Moreover, we find more characterizations for spherically concave functions.

• 충청수학회지
• /
• 제23권3호
• /
• pp.481-486
• /
• 2010

In this paper, we introduce the concepts of strongly c-convex( strongly c-concave) function, almost c-convex function on preconvex spaces. We investigate the relationships between such concepts and several types of preconvex sets.

• Journal of applied mathematics & informatics
• /
• 제13권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.

• Management Science and Financial Engineering
• /
• 제22권1호
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• 대한수학회보
• /
• 제51권5호
• /
• pp.1551-1559
• /
• 2014

We consider functions that map the open unit disc conformally onto the complement of an unbounded convex set with opening angle ${\pi}{\alpha}$, ${\alpha}{\in}(1,2]$, at infinity. We derive the exact interval for the variability of the real Taylor coefficients of these functions and we prove that the corresponding complex Taylor coefficients of such functions are contained in certain discs lying in the right half plane. In addition, we also determine generalized central functions for the aforesaid class of functions.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1636-1648
• /
• 2006

In this paper, we propose a new optimization approach to the rate control problem in a wired-cum-wireless network. A primal-dual interior-point(PDIP) algorithm is used to find the solution of the rate optimization problem. We show a comparison between the dual-based(DB) algorithm and PDIP algorithm for solving the rate control problem in the wired-cum-wireless network. The PDIP algorithm performs much better than the DB algorithm. The PDIP can be considered as an attractive method to solve the rate control problem in network. We also present a numerical example and simulation to illustrate our conclusions.