• Structural Engineering and Mechanics
• /
• 제26권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.

• 대한수학회논문집
• /
• 제9권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
• /
• 제32권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

• 한국경영과학회지
• /
• 제19권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.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 The Korea Society for Simulation 98 춘계학술대회 논문집
• /
• 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

• 시큐리티연구
• /
• 제18호
• /
• pp.143-167
• /
• 2009

21세기에 들어서면서 선진국은 민간경비산업의 전문화를 위해 자격제도 및 교육훈련을 강화하고 있는 추세이다. 우리나라도 전문성 강화를 위한 교육훈련 시스템의 변화를 시도하고 있으나 합리적이지 못한 선발기준과 교육시스템 운영으로 과점시장이 형성되어 있는 실정이다. 오히려 '직업면허제도'를 통하여 자격증 소지자나 경비업체, 교육기관 및 위탁자의 지대추구행위가 증가하고 있는 상태이다. 경비산업 종사자의 질적 향상을 목적으로 자격증 발급 및 지정교육기관을 통한 기본교육이 실시되고 있으나 실질적인 효과는 적은편이다. 이에 본 연구는 민간경비원 선발 및 교육에 관한 문제점을 찾아본 결과, 이원화된 검정제도와 교육시스템의 구조적 문제 그리고 경비업체 운영자 및 최고관리자(임원)의 전문성과 운영능력에 대한 검증이 전혀 이루어지지 않고 있는 것을 알 수 있었다. 이러한 문제를 해결하기 위해서는 이원화 되어있는 경비지도사 자격증 제도와 경비원 교육 이수 제도를 '공인자격검증제도'로 단일화하며, 그 자격검정 대상은 관련 종사자 전체로 확대하여야 할 것이다. 또한 시장 지배적 지위를 이용한 과점현상으로 발생되는 후생손실을 최소화하고 자율경쟁이 가능하도록 지정교육기관의 수를 늘리고 경비원들의 교육 및 취업(업체) 선택에 자율권을 부여하여야 할 것이다. 앞서 제시한 문제점들을 최소화 하고 객관성을 유지하기 위해서는 전문가 집단부터 이해관계자, 시민단체 까지 모두 참여하는 거버넌스 네트워크 형태의 '민간보안산업위원회'와 같은 새로운 관리 감독 기관 설립이 필요하다.

• 한국생산제조학회지
• /
• 제9권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.

• 대한산업공학회지
• /
• 제27권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.

• 대한수학회보
• /
• 제57권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년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• 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.