• Title/Summary/Keyword: 수정된 선형 계획법

Search Result 23, Processing Time 0.02 seconds

Multibody Elastic Contact Analysis by Modified Linear Programming (수정된 선형계획법을 이용한 다물체 탄성 접촉 문제 해석)

  • 이대희;전범준;최동훈;임장근;윤갑영
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.13 no.1
    • /
    • pp.1-8
    • /
    • 1989
  • A general and efficient algorithm is proposed for the analyses of multibody elastic contact problems. It is presumed that there exists negligible friction between the bodies. It utilizes a simplex type algorithm with a modified entry rule and incoporates finite element method to obtain flexibility matrices for arbitrarily shaped bodies. The multibody contact problem of a vehicle support on an elastic foundation is considered first to show the effictiveness of the suggested algorithm. Its solution is compared favorably with the existing solution. A contact problem among inner race, rollers and outer race is analyzed and the distribution of load, rigid body movements and contact pressure distributions are obtained. The trend of contact characteristics is compared with that of the idealized Hertzian solutions for two separate two-body contact problems. The numerical results obtained by directly treating a multibody contact are believed to be more exact than the Hertzian solution for the idealized two separate two-body contact problems.

A study on rivised simplex method for linear programming with unrestricted variables (비제약 변수를 포함한 선형계획법의 해법)

  • 소영섭;박순달
    • Korean Management Science Review
    • /
    • v.6 no.2
    • /
    • pp.97-104
    • /
    • 1989
  • 본 논문에서는 선형계획법에 비제약 변수가 포함될 경우 발생되는 제반 이론을 정리하고, 이를 이용하여 원문제를 소거법이나 치환법을 사용하지 않고 해를 구하는 변형된 수정단체법을 제시하려고 한다.

  • PDF

소규모 한글 선형계획법 소프트웨어 K-LP의 개발

  • 김세헌;김성륜;여재현
    • Korean Management Science Review
    • /
    • v.11 no.3
    • /
    • pp.27-34
    • /
    • 1994
  • 본 연구에서는 우리나라의 경영과학 입문자들이 선형계획 모형 개발 및 해석을 용이하게 할 수 있도록, 사용하기 편리하고 안정된 선형계획법 소프트웨어를 만들었다. 이 소프트웨어는 풀 수 있는 문제의 크기는 50 * 50으로 제한한 반면 한글로 모두 처리되도록 하였으며, 풀다운 메뉴방식으로 user friendly하며, 입문자들이 쉽게 이해할 수 있는 LINDO식 입력방식을 취하였으며, 패키지 내부에 완벽한 Editing 기능을 갖고 있어서 모형의 수정 보완이 매우 편리하게 되어 있다. 본 논문에서는 이 소프트웨어의 특성과 구조를 살펴본다.

  • PDF

Optimum Design of Cantilever Retaining Wall (켄틸레버 옹벽의 최적 설계)

  • 김종옥
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.37 no.1
    • /
    • pp.90-99
    • /
    • 1995
  • In this study, the algorithm for the optimum design of cantilever retaining wall was de veloped and solved using Modified Method of Feasible Directions(MMFD), Sequential Linear Programming(SLP) and Sequential Quadratic Programming(SQP). The algorithm was applied to the optimum design of 3-different height cantilever re tairing walls. It was shown that even though the starting points and optimization strategies are dif- ferent, the objective function and optimum design variables converge to within a close range, and consequently the reliability and efficiency of the underlying optimum design algorithm can be verified. It is expected that the optimum design algorithm developed in this study can be utilized efficiently for the optimum design of any scale cantilever retaining wall. Using optimum design method, cantilever retaining wall will be designed more economi- cally and reasonably than using traditional design method.

  • PDF

QR분해를 이용한 선형계획법의 구현과 그 효율에 관하여

  • 박찬규;성명기;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.09a
    • /
    • pp.189-199
    • /
    • 1995
  • 내부점 방법에서는 개선 방향을 대칭 양정치 행렬로 이루어지는 선형시스템 의 해를 구해야 하고 단체법에서는 단체 승수나 진입열을 계산하는데 기저 행렬로 이루어지는 선형시스템을 풀게된다. 본 연구는 내부점 기법과 단체법 에서 나타나는 선형시스템을 QR분해를 통해 푸는 방법을 구현하고 이에 대 한 결과를 제시하였다. QR분해 방법으로는 Givens가 제시한 방법을 사용했 으며 단체법에서 rank-one 수정 방법을 사용하였다. QR분해를 적용한 단체 법의 경우는 상.하 분해를 단체법에 비해 많이 느리며 내부점 기법에 적용하 면 촐레스키 분해보다 2-8배 정도 수행시간이 더 소요되었다. 그러나 내부점 기법에서 QR분해 방법이 촐레스키 분해 방법에 비해 보다 수치적으로 보다 정확하였다.

  • PDF

Application of Modified Particle Swarm Optimization algorithm into OPF (A Modified Particle Swarm Optimization 기법을 이용한 추적조류계산 알고리즘)

  • Kim, Young-Yong;Kim, Jong-Yul;Jang, Se-Hwan;Lee, Haw-Seok;Park, June-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2007.11b
    • /
    • pp.127-129
    • /
    • 2007
  • 최적조류계산(Optimal Power Flow:OPF)은 전력계통에서 여러 가지 제약 조건을 만족하면서 경제적이고 안전하게 계통을 운영하기 위한 기법이다. 종래의 계산방법에는 비선형 계획법, 선형계획법 같은 수치해석적인 방법을 사용하였다. 그러나, 이러한 방법들은 전역 최저해를 구하기 위해서는 목적함수가 convex해야 한다. 또한, 계통 규모가 클 경우, 최적해 수렴이 안 되거나 수렴이 되더라도 시간이 많이 걸리는 단점이 있다. 최근에는 이러한 문제를 극복하고자 여러 가지 진화연산기법들이 최석조류계산 문제에 적용되고 있다. 본 논문에서 최근에 등장한 PSO알고리즘을 수정한 MPSO알고리즘은 이용한 최적조류계산 기법을 소개하고, 제안한 방법의 유용성을 보이기 위하여 IEEE 30,118 모선 계통의 최적 조류계산 문제에 적용하였다.

  • PDF

Data Assimilation Techniques Applied to Estimate the Dispersion of the Pollutant in the Atmosphere (자료동화기술을 이용한 대기중 오염물질 확산평가)

  • 한문희;정효준;김은한;서경석;황원태;이선미
    • Proceedings of the Korean Radioactive Waste Society Conference
    • /
    • 2004.06a
    • /
    • pp.368-376
    • /
    • 2004
  • The estimation of the diffusion coefficients of the Gaussian plume model and the release rate by assimilation of tracer-gas measurements on Younggwang site was tested. Diffusion coefficients were modified by linear programming of both the measurements and the simulated using the Gaussian plume model. The application of the modified diffusion coefficients improved the prediction ability of the Gaussian plume model on both 3 km and 8 km arc lines. And, the release rate of tracer gas was estimated using least squares method. The optimal source rate was estimated by minimizing the errors between the measured concentrations and the computed ones by the Gaussian plume model. The obtained release rate showed a good agreement with the real release rate of the Younggwang experiment in 24%.

  • PDF

Optimal Unit Commitment of Hydropower System Using Combined Mixed Integer Programming (통합혼합정수계획법 모형을 이용한 수력발전소의 최적 발전기 운영계획 수립)

  • Lee, Jae-Eung
    • Journal of Korea Water Resources Association
    • /
    • v.32 no.5
    • /
    • pp.525-535
    • /
    • 1999
  • An optimal unit commitment model for efficient management of water and energy resources in a basin using combined mixed integer programming is developed. The combined mixed integer programming model is able to solve the inconsistency problem that may occur from mixed integer programming models. The technique which enables the use of conditional constraints and either-or constraints in the linear programming is also suggested. As a result of applying the combined mixed integer programming model to Lower Colorado River Basin in United States. the basin efficiency is decreased by 1.53% from the results of the mixed integer programming, while it is increased by 0.67% from the results of the historical operation. It is found that the decreased allowable error between power supplies and demands in the combined mixed integer programming causes the decreased basin efficiency.

  • PDF

Coefficient change of objective function not change to the basic vector make a optimum solution (최적해를 이루는 기저벡터가 변화를 초래하지 않는 목적함수계수의 변화)

  • 송필준;김정숙
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.1
    • /
    • pp.58-65
    • /
    • 2002
  • When we estimate the optimal solution satisfy the objective function and subjective equation in the integer programming, The optimal solution of the objective function Z is decided by the positive integer at extreme point or revised extreme point in the convex set. The convex set is made up the linear subjective equation. The purpose of the paper is thus to establish a stepwise optimization in the integer programming model by estimating the variation △C/sub j/ of the constant term C/sub j/ in the linear objective function, after an application of the modified Branch & Bound method.

  • PDF

Bootstrap Calibrated Confidence Bound for Variance Components Model (분산 성분 모형에 대한 붓스트랩 보정 신뢰구간)

  • Lee, Yong-Hee
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.3
    • /
    • pp.535-544
    • /
    • 2006
  • We consider use of Bootstrap calibration in the problem of setting a confidence interval for a linear combination of variance components. Based on the the modified large sample(MLS) method by Graybill and Wang(1980), Bootstrap Calibration is applied to improve the coverage probability of the MLS confidence bound when the experiment is balanced and coefficients of a linear combination are positive. Performance of the proposed confidence bound in small sample is investigated by simulation studies.