• Title/Summary/Keyword: Simplex 법

Search Result 102, Processing Time 0.024 seconds

Propeller Skew Optimization Considering Varying Wake Field (선체반류를 고려한 프로펠러 최적 스큐화)

  • 문일성;김건도;유용완;류민철;이창섭
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.40 no.5
    • /
    • pp.26-35
    • /
    • 2003
  • Propellers operating in a given nonuniform ship wake generate unsteady loads leading to undesirable stern vibration problems. The skew is known to be the most proper and effective geometric parameter to control or reduce the fluctuating forces on the shaft. This paper assumes the skew profile as either a quadratic or a cubic function of the radius and determines the coefficients of the polynomial function by applying the simplex method. The method uses the converted unconstrained algorithm to solve the constrained minimization problem of 6-component shaft excitation forces. The propeller excitation was computed either by applying the two-dimensional gust theory for quick estimation or by the fully three-dimensional unsteady lifting surface theory in time domain for an accurate solution. A sample result demonstrates that the shaft forces can be further reduced through optimization from the original design.

Evolutionary Operation of Mixture Components Using Regular Simplex (정규 심플렉스를 이용한 혼합물 성분변수의 진화적 조업법)

  • Kim, Chi-Hwan;Byun, Jai-Hyun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.92-95
    • /
    • 2004
  • A mixture experiment is a special type of response surface experiment in which the factors are the ingredients or components of a mixture, and the response is a function of the proportions of each ingredient. Evolutionary operation is useful to improve on-line full-scale manufacturing processes by systematically changing the levels of the process variables without jeopardizing the product. This paper presents an evolutionary operation procedure for large-scale mixture production processes based on simplex search procedure, which can be beneficial to practitioners who should improve on-line mixture process quality while meeting the production schedule of the mixture product.

  • PDF

A Study on Determination of Optimal Incentives of DSM Programs by Linear Programming (선형계획법에 의한 수요관리 프로그램의 최적 지원금 결정에 관한 연구)

  • Lee, Byung-Ha;Kim, Jung-Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.3
    • /
    • pp.517-523
    • /
    • 2011
  • A lot of DSM (Demand Side Management) programs have been implemented to promote the effective utilization of resources and the rational development of power industry, and various economic analyses and policy-based studies on DSM have been executed to determine effective subsidy budget. In this paper, a new objective function for deciding an optimal incentive allocation among various programs is presented by introducing the maximization of the total saving power of the programs. For simplicity, the objective function and the constraints is linearized to apply LP(Linear Programming) method. LP program based on Simplex Method was developed by MATLAB. An optimal incentive allocation of 4 DSM programs is presented by the use of the developed MATLAB program.

Experimental Comparisons of Simplex Method Program's Speed with Various Memory Referencing Techniques and Data Structures (여러 가지 컴퓨터 메모리 참조 방법과 자료구조에 대한 단체법 프로그램 수행 속도의 비교)

  • Park, Chan-Kyoo;Lim, Sung-Mook;Kim, Woo-Jae;Park, Soon-Dal
    • IE interfaces
    • /
    • v.11 no.2
    • /
    • pp.149-157
    • /
    • 1998
  • In this paper, various techniques considering the characteristics of computer memory management are suggested, which can be used in the implementation of simplex method. First, reduction technique of indirect addressing, redundant references of memory, and scatter/gather technique are implemented, and the effectiveness of the techniques is shown. Loop-unrolling technique, which exploits the arithmetic operation mechanism of computer, is also implemented. Second, a subroutine frequently called is written in low-level language, and the effectiveness is proved by experimental results. Third, row-column linked list and Gustavson's data structure are compared as the data structure for the large sparse matrix in LU form. Last, buffering technique and memory-mapped file which can be used in reading large data file are implemented and the effectiveness is shown.

  • PDF

Inversion of SAW Dispersion Data to Determine the Elastic Constants of a Thin film (표면파속도와 역산법에 의한 박막탄성계수 산출)

  • 김진오
    • Journal of the KSME
    • /
    • v.34 no.7
    • /
    • pp.510-516
    • /
    • 1994
  • 탄성파의 속도는 파동 전파 매질의 밀도와 탄선계수에 달려 있으므로, 박막이 입혀진 기판에서 전파하는 표면파에 대해서 기판과 박막의 밀도와 탄성계수 및 박막의 두께 등을 알면 전파 속 도를 계산할 수 있다. 박막의 탄성계수를 모르는 경우에는 표면파 속도를 측정하여 역으로 탄 성계수를 산출할 수 있다. 이러한 역산과정에는 일반적인 비선형 방정식의 curve-fitting에 이용될 수 있는 simplex법이 효율적으로 활용된다. 이 글에서는 표면파 속도를 측정하고 그 데이터로 부터 역산하여 박막의 탄성계수를 구하는 원리와 과정을 설명한다.

  • PDF

Security Constrained Economic Dispatch based on Interior Point Method (내점법에 의한 선로 전력 조류 제약을 고려한 경제급전에 관한 연구)

  • Kim, Kyoung-Shin;Lee, Seong-Chul;Jung, Leen-Hark
    • Proceedings of the KIEE Conference
    • /
    • 2006.07a
    • /
    • pp.311-312
    • /
    • 2006
  • 본 논문에서는 선로 전력조류제약을 고려한 경제급전(SCED : Security-Constrained economic dispatch)에 내점 선형계획법을 이용하여 최적해를 구하는 문제를 다룬다. 최적전력조류(Optimal Power Flow)식으로부터 선로의 유효전력만을 근사화하여 선로 전력조류 제약을 고려할 경제급전(SCED)의 식을 정식화한다. 선형계획법을 적용하여 최적해를 구하기 위해서 발전기출력과 유효전력, 부하, 손실과의 관계를 이용하여 경제급전의 식을 선형화 하는 알고리즘을 제시한다. 선형화 알고리즘은 목적함수로 계통 발전기의 총 연료비를 취하고 전력수급평형식으로 발전기출력증분에 대한 선로의 증분손실계수를 이용하며, 선로의 제약조건은 일반화발전 분배계수(GGDF : Generalized Generation Distribution Factor)를 이용하여 선형화한다. 최적화 기법으로서 내점법(Interior Point Method)을 적용하고자 하며 사례연구를 통하여 선형계획법 중 가장 많이 사용하는 심플렉스(Simplex)법과의 수렴특성을 비교하여 내점 법의 효용성을 확인하고자 한다.

  • PDF

Simple Algorithm for Large-scale Unbalanced Transportation Problem (대규모 불균형 수송문제의 간단한 해법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.223-230
    • /
    • 2015
  • As the Transportation Simplex Method of the general transportation problem are inapplicable to the large-scale unbalanced transportation problem, a commercialized linear programming package remains as the only viable means. There is, however, no method made available to verify the optimality of solutions attained by the package. This paper therefore proposes a simple heuristic algorithm to the large-scale unbalanced transportation problem. From a given problem of $31{\times}15$supply and demand areas, the proposed algorithm determines the number of demands areas for each supply area and executes on the latter in the ascending order of each of their corresponding demand areas. Next, given a single corresponding demand area, it supplies the full demand volume and else, it supplies first to an area of minimum associated costs and subsequently to the rest so as to meet the demand to the fullest extent. This initial optimal value is then optimized through an adjustment process whereby costs are minimized as much as possible. When tested on the $31{\times}15$cost matrix, the proposed algorithm has obtained an optimal result improved from the commercial linear programming package by 8.9%.

The Assignment-Swap Algorithm for Large-scale Transportation Problem with Incomplete Cost Lists (불완전 비용 리스트를 가진 대규모 수송문제의 배정-교환 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.51-58
    • /
    • 2015
  • This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

Semi-Empirical MO Calculations and Infrared Spectroscopy of Hydrogen-Bonding in Alkyl Alcohols (알킬알코올의 수소결합에 대한 적외선분광법 및 반경험적분자궤도함수의 계산)

  • Jong Taik Kim;Doo Seon Park
    • Journal of the Korean Chemical Society
    • /
    • v.31 no.1
    • /
    • pp.3-13
    • /
    • 1987
  • Infrared absorption spectra of alkyl alcohols in the OH stretching region were obtained from varying the concentrations of alcohols in $CCl_4$. The OH stretching bands were broadened and shifted to lower frequencies due to the hydrogen-bond formation. Three bands were obtained from the breakdown of these bands by the simplex method. Each band was assigned to various types of hydrogen-bonded OH groups. The electronic structures and interaction energies of dimeric and trimeric alcohols were calculated by semi-empirical MO(CNDO/2, INDO) methods. These results were in good agreement with those of deconvoluted ir spectra. The EDA(electron donor-acceptor) effect of alkyl group on hydrogen-bond formation was in the decreasing order of butyl > propyl > ethyl > methyl group. On the other hand, the experimental results were in the order : propyl > ethyl > butyl > methyl group. This seemed to be ascribed to the bulkiness of butyl alcohol.

  • PDF

핵산 유도체들에 대한 in vitro 항바이러스 약효검색

  • 이종교
    • Proceedings of the Korean Society of Applied Pharmacology
    • /
    • 1993.04a
    • /
    • pp.112-112
    • /
    • 1993
  • 바이러스 치료제 개발을 위하여 합성된 핵산유도체 11개에 대한 in vitro 항바이러스 약효검색을 수행하였다. 검색대상 바이러스로서 외피보유 DNA 바이러스인 human herpesvirus에 속하는 herpes simplex virus type 1과 type 2에 대해서는 Vero 세포체계에서 3일 후 CPE 저해정도를 MTT 검색법으로 cytomegalovirus에 대해서는 HEL 세포체계에서 7일 후 Giemsa 염색법으로 약효를 측정하였다. 외피비보유 RNA 바이러스인 picornavirus에 속하는 poliovirus type 1과 type 3과 coxsackie B virus type 3에 대한 약효를 HeLa 세포체계에서 2일 후 CPE 저해정도를 MTT 검색법으로 측정하였다. 아울러 selectivity index를 구하기 위하여 Vero와 HeLa 세포에 대한 약물자체의 독성인 cytocidal effect를 MIT 검색법으로 측정하였다. 그 결과 항 herpesvirus 약효는 어떤 물질에서도 발견되지 않았으나 한 물질이 poliovirus type 1과 3에 대하여 selectivity index 10정도 (CC$_{60}$ 38 ug/ml, EC$_{50}$ 1-4 ug/ml)를 나타내었고 자세한 기작은 좀 더 조사할 필요가 있다.

  • PDF