• Honam Mathematical Journal
• /
• v.40 no.4
• /
• pp.765-770
• /
• 2018

In this paper, we investigate the majorization properties for certain subclasses of analytic functions of complex order. Moreover, some interesting consequences of our main theorem are pointed out.

• Korean Journal of Mathematics
• /
• v.32 no.1
• /
• pp.173-182
• /
• 2024

In this paper, we derive the necessary and sufficient conditions for the Gaussian hypergeometric function to be in some subclasses of analytic functions.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.52-65
• /
• 1997

For the degradation of severe noise and ill-conditioned blur the optimization function has the solution spaces which have many local optima around global solution. General restoration methods such as inverse filtering or gradient methods are mainly dependent on the properties of degradation model and tend to be isolated into a local optima because their convergences are determined in the convex space. Hence we introduce genetic algorithm as a searching method which will search solutions beyond the convex spaces including local solutins. In this paper we introudce improved evaluation square error) and fitness value for gray scaled images. Finally we also proposed the local fine tunign of window size and visit number for delicate searching mechanism in the vicinity of th global solution. Through the experiental results we verified the effectiveness of the proposed genetic operators and evaluation function on noise reduction over the conventional ones, as well as the improved performance of local fine tuning.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.2
• /
• pp.99-107
• /
• 2007

We consider (worst-case) robust optimization versions of the Economic Order Quantity (EOQ) model with decreasing cost functions. Two variants of the EOQ model are discussed, in which the purchasing costs are decreasing power functions in either the order quantity or demand rate. We develop the corresponding worst-case robust optimization models of the two variants, where the parameters in the purchasing cost function of each model are uncertain but known to lie in an ellipsoid. For the robust EOQ model with the purchasing cost being a decreasing function of the demand rate, we derive the analytical optimal solution. For the robust EOQ model with the purchasing cost being a decreasing function of the order quantity, we prove that it is a convex optimization problem, and thus lends itself to efficient numerical algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• Management Science and Financial Engineering
• /
• v.18 no.2
• /
• pp.23-27
• /
• 2012

The problem of jointly determining a robust optimal bundle of price and order quantity for a retailer in a single-retailer, single supplier, single-product supply chain is considered. Demand is modeled as a decreasing power function of product price, and unit purchasing cost is modeled as a decreasing power function of order quantity and demand. Parameters defining the two power functions are uncertain but their possible values are characterized by ellipsoids. We extend a previous study in two ways; the purchasing cost function is generalized to take into account the economies of scale realized by higher product demand in addition to larger order quantity, and an exact transformation into an equivalent convex optimization program is developed instead of a geometric programming approximation scheme proposed in the previous study.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.11 s.104
• /
• pp.1255-1261
• /
• 2005

The dynamic contact model of a beam that contacts to a rigid wall in a reactor core was studied. The gap between the beam and contact wall results in dynamic contact accompanying inequality constraints. The inequality constraints can be relieved to an equality constraint problem by introducing a convex Penalty function. In this work, a beam with contact condition is formulated using quasi-convex penalty function and numerically solved. General coordinate solution is adopted to raise computational efficiency. Also nonlinearity is examined In the beam contacting to a rigid wall.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1353-1362
• /
• 2003

This paper considers a simultaneous optimization problem of structure and control systems. The problem is generally formulated as a non-convex optimization problem for the design parameters of mechanical structure and controller. Therefore, it is not easy to obtain the global solutions for practical problems. In this paper, we parameterize all design parameters of the mechanical structure such that the parameters work in the control system as decentralized static output feedback gains. Using this parameterization, we have formulated a simultaneous optimization problem in which the design specification is defined by the Η$_2$and Η$\_$$\infty$/ norms of the closed loop transfer function. So as to lead to a convex problem we approximate the nonlinear terms of design parameters to the linear terms. Then, we propose a convex optimization method that is based on linear matrix inequality (LMI). Using this method, we can surely obtain suboptimal solution for the design specification. A numerical example is given to illustrate the effectiveness of the proposed method.

• Journal of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.253-267
• /
• 2000

• Transactions of the Korean Society of Automotive Engineers
• /
• v.18 no.2
• /
• pp.56-60
• /
• 2010

Since the forming process involves the strain rate effect, a yield function considering the strain rate is indispensible to predict the accurate final blank shape in the forming simulation. One of the most widely used in the forming analysis is the Hill48 quadratic yield function due to its simplicity and low computing cost. In this paper, static and dynamic uni-axial tensile tests according to the loading direction have been carried out in order to measure the yield stress and the r-value. Based on the measured results, the Hill48 yield loci have been constructed, and their performance to describe the plastic anisotropy has been quantitatively evaluated. The Hill48 quadratic yield function has been modified using convex combination in order to achieve accurate approximation of anisotropy at the rolling and transverse direction.