• Structural Engineering and Mechanics
• /
• v.26 no.1
• /
• pp.15-30
• /
• 2007

In the paper, one focuses on the problem of duality in non-linear programming, applied to the solution of no-tension problems by means of Limit Analysis (LA) theorems for Not Resisting Tension (NRT) models. In details, one demonstrates that, starting from the application of the duality theory to the non-linear program defined by the static theorem approach for a discrete NRT model, this procedure results in the definition of a dual problem that has a significant physical meaning: the formulation of the kinematic theorem.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.607-616
• /
• 1994

I. M. Gelfand and G. E. Shilov [GS] introduced the Gelfand-Shilov spaces of type S, generalized type S and type W of test functions to investigate the uniqueness of the solutions of the Cauchy problems of partial differential equations. Using the heat kernel method Matsuzawa gave structure theorems for distributions, hyperfunctions and generalized functions in the dual space $(S^s_r)'$ of the Gelfand-Shilov space of type S in [M1, M2 and DM], respectively. Also, we gave structure theorems for ultradistributions, Fourier hyperfunctions in [CK, KCK], respectively.

• East Asian mathematical journal
• /
• v.32 no.5
• /
• pp.635-639
• /
• 2016

In this paper, we prove a sufficient optimality theorems for the problem(FP) under(V, ${\rho}$)-invexity assumption. And we give Mond-Weir type dual problem and proved weak and strong duality theorem under (V, ${\rho}$)-invexity

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.189-199
• /
• 1994

This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• Korean Security Journal
• /
• no.18
• /
• pp.143-167
• /
• 2009

As of entering the 21st century, a trend in the field of a private security industry among the advanced countries have been increased a qualification system and train session to meet the needs of professionalism. Intensifying the professionalism in Korea, education and train system has been initiated to change but the oligopoly market already formulated due to impractical selection standard and management of education system. Issuing certification and offering basic training through a designated institution for the purpose of improving quality of the private security industry worker, its practical effectiveness were lower than expectation. Rather certification-holder or security agency, institution or truster's rent-seeking behavior have been increased by occupational licensing system. The founded results, which were associated to problems in selecting and educating to the private security guard, in this study were that any verification has been initiated towards dual-system in official approval and structural problems in education system, and non-existence of verification for professionalism and management capability to security agency owner and its upper managerial level. Current a dual system in an officially authorized verification system and completion of security guard credential requested change to an unified official qualification verification system to solve those problems. Ranges of an applicant to the unified official qualification verification system should be extend to the whole population in the private security industry. Moreover, minimization of the dead-weigh loss, which is caused by oligopoly phenomenon while using its market-dominant status, increasement number of designated institution, which allows self-regulating competition, and endowment of autonomy, which is in selecting education and agency, were requested to solve the problems in selecting and educating to the private security guard. In order to minimize stated problems while maintaining objectiveness, a new manage and supervise institution, which is called a 'private security industry committee', should be establish. The private security industry committee is a formation of governance network which are participated from professional group to civil organization.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.2
• /
• pp.59-65
• /
• 2000

In this paper the comparison of the first order approximation schemes such as SLP(sequential linear programming) CONLIN(convex linearization) MMA(method of moving asymptotes) and the second order approximation scheme SQP(sequential quadratic programming) was accomplished for optimization of nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore when it is considered with the expense of computation MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem it was applied to the helicopter tail boom con-sidering column buckling and local wall buckling constraints. it is concluded that MMA can be a very efficient approxima-tion scheme from simple problems to complex problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.274-280
• /
• 2001

In this research, we develop a specialized primal-dual interior point solver for the multicommodity flow problems (MCFP). The Castro's approach that exploits the problem structure is investigated and several aspects that must be considered in the implementation are addressed. First, we show how preprocessing techniques for linear programming(LP) are adjusted for MCFP. Secondly, we develop a procedure that extracts a network structure from the general LP formulated MCFP. Finally, we consider how the special structure of the mutual capacity constraints is exploited. Results of comupational comparison between our solver and a general interior point solver are also included.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.459-479
• /
• 2020

In the last two decades, codes over noncommutative rings have been one of the main trends in coding theory. Due to the fact that noncommutativity brings many challenging problems in its nature, still there are many open problems to be addressed. In 2015, generator polynomial matrices and parity-check polynomial matrices of generalized quasi-cyclic (GQC) codes were investigated by Matsui. We extended these results to the noncommutative case. Exploring the dual structures of skew constacyclic codes, we present a direct way of obtaining parity-check polynomials of skew multi-twisted codes in terms of their generators. Further, we lay out the algebraic structures of skew multipolycyclic codes and their duals and we give some examples to illustrate the theorems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.468-468
• /
• 1991

The variable-frequency type water supply equipment, which adopts the variable-voltage and variable-frequency converter(VVVF converter) to govern automatically the rotating speed of a pump, can save 15-20% of power, as compared with a throttle-controlled pump device or an airpressurized water supply equipment, and is finding a wide application. However, it still has some disadvantages : greater pressure fluctuations during switching over the pump and prolonged low-effeciency running of the pump in the case of small consumption of water. Therefore, it is difficult to apply the equipment to the fire water supply system where the water should not be put into use unless a fire takes place, and the water pressure in pipelines should permanently remain constant. This paper introduces the automatic regulation principle of the variable-frequency type air-pressurized water supply equipment (hereafter referred to as simply BFQS equipment) for dual purposes of daily life and fire control, which combined both technologies of speed governing by a converter and air-pressurized water supplying, then discusses some problems related to automatic control, and finally gives the experimental results of an embodiment-BPQS-100-50 water supply equipment.