• Journal of the Korean Mathematical Society
• /
• v.40 no.2
• /
• pp.287-305
• /
• 2003

Second order necessary optimality condition for properly efficient solutions of a twice differentiable vector optimization problem is given. We obtain a nonsmooth version of the second order necessary optimality condition for properly efficient solutions of a nondifferentiable vector optimization problem. Furthermore, we prove a second order necessary optimality condition for weakly efficient solutions of a nondifferentiable vector optimization problem.

• Communications of the Korean Mathematical Society
• /
• v.19 no.1
• /
• pp.179-196
• /
• 2004

Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.505-514
• /
• 2023

In this paper, we consider a second-order cone linear fractional vector optimization problems (FVP), and obtain sequential optimality theorems for (FVP) which hold without any constraint qualification and which are expressed by sequences.

• Journal of Korean Society of Transportation
• /
• v.12 no.3
• /
• pp.5-13
• /
• 1994

In the fields of rail and road design, most vertical alignment design have been thus far heavily dependent upon trial-and-errors of experienced engineers. However, it has long been inefficient in productivity of designing process. In order to overcome this inefficiency, this paper presents the optimal vertical alignment design method using mathematical optimization techniques. For optimization, mathematical model to minimize the construction cost is formulated and the separable programming technique and the Zoutendijk method are introduced to solve it. As result, it is shown that this optimization technique can give efficient solutions to all vertical alignment design fields with properly-estimated cost function.

• Journal of Navigation and Port Research
• /
• v.40 no.5
• /
• pp.337-343
• /
• 2016

The core decisions of bulk shipping businesses can be summarized as the timing and the choice of period for which carrying capacity is traded. In particular, frequent decisions to trade freight either with repeated spot transactions or with a one-off long-term deal critically impact business performance. Even though a variety of freight trading strategies can be employed to facilitate the decisions, chartering practitioners have not been active in utilizing these strategies, and academic research has rarely proposed applicable solutions. The specific properties of freight as a tradable commodity are not properly reflected in existing studies, and limitations have been reported in their application to the real world. This research focused on the establishment of applicable freight trading strategies by taking into account two properties of freight: time perishability and term-dependant pricing. In addition to traditional trading strategies, artificial neural networks were applied for the first time to the test of freight trading strategies. The performances of the trading strategies were measured and compared to produce a remarkable outperformance of the ANN. This research is expected to make a significant contribution to chartering practices by enhancing the quality of chartering decisions and eventually enabling the effective management of freight rate risk. In addition to methodological expansion, the result will propose a way to approach the controversial issue of freight market efficiency.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.6 s.177
• /
• pp.1529-1539
• /
• 2000

A newly developed optimization method which uses the genetic algorithm combined with the sensitivity analysis is presented in this paper. The genetic algorithm is a probabilistic method, searching the optimum at several points simultaneously, requiring only the values of the object and constraint functions. It has therefore more chances to find global solution and can be applied various problems. Nevertheless, it has such shortcomings that even it approaches the optimum rapidly in the early stage, it slows down afterward and it can't consider the constraints explicitly. It is only because it can't search the local area near the current points. The traditional method, on the other hand, using sensitivity analysis is of great advantage in searching the near optimum. Thus the combination of the two techniques makes use of the individual advantages, that is, the superiority both in global searching by the genetic algorithm and in local searching by the sensitivity analysis. Application of the method to the several test functions verifies that the method suggested is very efficient and powerful to find the global solutions, and that the constraints can be considered properly.

• Smart Media Journal
• /
• v.5 no.1
• /
• pp.114-121
• /
• 2016

Currently, different medical institutions have been carrying out the e-healthcare system project. The system includes electronic medical record and prescription delivery system, and, the Medical Treatment law permits electronic signature for medical record management, which reduced the relevant costs and enabled sharing medical record. And medical solution using online certificates is expanding its application. In that light, the role of certificates became more important than ever. However, in contrast to active effort made to manage personal certificates, certificates related to medical solutions and other types of work are not being managed properly. Most work-related certificates are saved in office computers, which makes them vulnerable to various security threats. Although certificate servers can be used as a solution to this problem, hospitals must build the server separately and, therefore, small and medium-size hospitals can be reluctant to bear the burden. This study proposed a way to design and implement an effective and secure certificate management system by save the certificate file as a BLOB, using existing resources without needing to build a separate certificate server, at minimized costs.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.539-550
• /
• 2005

The spanning tree, which is being used the most widely in indoor wiring network, is chosen for the network topology of the optimal LAN design. To apply a spanning tree to GA, the concept of $Pr\ddot{u}fer$ numbers is used. $Pr\ddot{u}fer$ numbers can express he spanning tree in an efficient and brief way, and also can properly represent the characteristics of spanning trees. This paper uses Pareto Stratum-Niche Cubicle(PS-NC) GA by complementing the defect of the same priority allowance in non-dominated solutions of pareto genetic algorithm(PGA). By applying the PS-NC GA to the LAN design areas, the optimal LAN topology design in terms of minimizing both message delay time and connection-cost could be accomplished in a relatively short time. Numerical analysis has been done for a hypothetical data set. The results show that the proposed algorithm could provide better or good solutions for the multi-objective LAN design problem in a fairly short time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.6
• /
• pp.135-144
• /
• 2009

This paper discusses an issue of serious security risks at web log which contains private information, and suggests solutions to protect them. These days privacy is core information to produce value-added in information society. Its scope and type is expanded and is more important along with the growth of information society. Web log is a privacy information file enacted as law in South Korea. Web log is not protected properly in spite of that has private information It just is treated as residual product of web services. Many malicious people could gain private information in web log. This problem is occurred by no classified data and improper development of web application. This paper suggests the technical solutions which control data in development phase and minimizes that the private information stored in web log, and applies in operation environment. It is very efficient method to protect private information and to observe the law.