• Title/Summary/Keyword: Simplex Method

Search Result 251, Processing Time 0.028 seconds

An Efficient Algorithm for a Block Angular Linear Program with the Same Blocks (부분문제가 같은 블록대각형 선형계획문제의 효율적인 방볍)

  • 양병학;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.12 no.2
    • /
    • pp.42-50
    • /
    • 1987
  • This objective of this paper is to develop an efficient method with small memory requirement for a feed-mixing problem on a micro computer. First this method uses the decomposition principle to reduce the memory requirement. Next, the decomposition principle is modified to fit the problem. Further four different variations in solving subproblems are designed in order to improve efficiency of the principle. According to the test with respect to the processing time, the best variation is such that the dual simplex method is used, and the optimal basis of a previous subproblem is used as an initial basis, and the master problem is (M +1) dimensional. In general, the convergence of solution becomes slower near the optimal value. This paper introduces a termination criterion for a sufficiently good solution. According to the test, 5%-tolerence is acceptable with respect to the relation between the processing time and optimal value.

  • PDF

Resolutions of NP-complete Optimization Problem (최적화 문제 해결 기법 연구)

  • Kim Dong-Yun;Kim Sang-Hui;Go Bo-Yeon
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.1
    • /
    • pp.146-158
    • /
    • 1991
  • In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

  • PDF

Optimization of Fuzzy Neural Network based Nonlinear Process System Model using Genetic Algorithm (유전자 알고리즘을 이용한 FNNs 기반 비선형공정시스템 모델의 최적화)

  • 최재호;오성권;안태천
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.267-270
    • /
    • 1997
  • In this paper, we proposed an optimazation method using Genetic Algorithm for nonlinear system modeling. Fuzzy Neural Network(FNNs) was used as basic model of nonlinear system. FNNs was fused of Fuzzy Inference which has linguistic property and Neural Network which has learning ability and high tolerence level. This paper, We used FNNs which was proposed by Yamakawa. The FNNs was composed Simple Inference and Error Back Propagation Algorithm. To obtain optimal model, parameter of membership function, learning rate and momentum coefficient of FNNs are tuned using genetic algorithm. And we used simplex algorithm additionaly to overcome limit of genetic algorithm. For the purpose of evaluation of proposed method, we applied proposed method to traffic choice process and waste water treatment process, and then obtained more precise model than other previous optimization methods and objective model.

  • PDF

Detection of Herpes Simplex Virus, Varicella-Zoster Virus and Human Herpes Virus-6 by PCR in Cerebrospinal Fluid from Hospitalized Adult Patients with Aseptic Meningitis or Encephalitis (무균성 뇌막염과 뇌염으로 입원한 성인 환자 뇌척수액에서 중합효소 연쇄반응에 의한 HSV, VZV, HHV-6의 검출)

  • Park, Hae-Kyung;Woo, So-Youn;Kim, Hyun-Jin;Chong, Young-Hae
    • The Journal of Korean Society of Virology
    • /
    • v.30 no.3
    • /
    • pp.171-178
    • /
    • 2000
  • Herpes simplex virus, Varicella zoster virus and Human herpes virus-6 caused central nervous system infections and latent infections but there is no data of the 3 viruses being tested from the same cerebrospinal fluid samples with aseptic meningitis or encephalitis in adults patients. These viruses produced similar neurologic symptoms but difficulties existed in differentiating of etiologic agents and therefore the viruses needed to be detected in the early state. Herpes simplex virus encephalitis (HSVE) in adults, if not treated promptly was fatal. If treated with antiviral drugs in the early phase of encephalitis, neurologic sequales decreased by 65%. Recently, a PCR method for detection of HSVE with CSF was developed. VZV primary and secondary infections caused neurologic symptoms of encephalitis or meningitis. The second frequency of adult encephalitis that caused VZV were reported. HHV-6 caused CNS latent infection that was studied with normal adults brains. But there is no data of HSV, VZV and HHV-6 for aseptic meningitis and encephalitis of Korean adults through etiologic study. We cultured CSFs on HEp-2 cells and simultaneously tested for HSV PCR, VZV nested PCR and HHV-6 PCR with 8 specific primers. The PCR results of CSF from meningitis Korean adults were 13/19 (68.4%) for HSV, 10/19 (52.6%) for VZV and 12/19 (63.2%) for HHV-67/19 (36.8%) cases were triple infected HSV PCR, VZV PCR and HHV-6 PCR positive; 3/19 (15.8%) cases were dual infected HSV PCR and HHV-6 PCR positive; 1119 (0.5%) cases was VZV PCR positive. Strong viral DNA amplification of CSF means a causative virus may be present in aseptic meningitis or encephalitis patients and may cause clinical neurologic symptoms. HSV and HHV-6 viruses detection rate were higher than VZV by PCR with CSFs.

  • PDF

Determination of the Optimal Height using the Simplex Algorithm in Network-RTK Surveying (Network-RTK측량에서 심플렉스해법을 이용한 최적표고 결정)

  • Lee, Suk Bae;Auh, Su Chang
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.35-41
    • /
    • 2016
  • GNSS/Geoid positioning technology allows orthometric height determination using both the geoidal height calculated from geoid model and the ellipsoidal height achieved by GNSS survey. In this study, Network-RTK surveying was performed through the Benchmarks in the study area to analyze the possibility of height positioning of the Network-RTK. And the orthometric heights were calculated by applying the Korean national geoid model KNGeoid13 according to the condition of with site calibration and without site calibration and the results were compared. Simplex algorithm was adopted for liner programming in this study and the heights of all Benchmarks were calculated in both case of applying site calibration and does not applying site calibration. The results were compared to Benchmark official height of the National Geographic Information Institute. The results showed that the average value of the height difference was 0.060m, and the standard deviation was 0.072m in Network-RTK without site calibration and the average value of the height difference was 0.040m, and the standard deviation was 0.047m in Network-RTK with the application of the site calibration. With linearization method to obtain the optimal solution for observations it showed that the height determination within 0.033m was available in GNSS Network-RTK positioning.

Practical Consolidation Analysis and Back Analysis for Draainage-Installed Compressible Deposits (배수재가 설치된 압축성 지반의 효율적인 압밀해석 및 역해석)

  • 김윤태;이승래
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 1994.09a
    • /
    • pp.175-181
    • /
    • 1994
  • In order to accelerate the rate of consolidation settlement and to gain a required shear strength for a given soft clay deposit, the preloading technique combined with a vertical drainage system has been widely applied. In this study, the theory of axisymmetric concolidation, which considers the variation of compressibility and permeability during the consolidation process, has been developed. Smear and well resistance effects are also considered. Furthermore, several back-analysis schemes such as simplex method, BFGS method, and ADS have been adopted in the axisymmetric consolidation program(AXICON). The measured data in the first stage of consolidation are utilized to predict the subsequent consolidation behavior.

  • PDF

A Practical Approach for Optimal Design of Pipe Diameters in Pipe Network (배관망에서의 파이프 직경 최적설계에 대한 실용적 해법)

  • Choi Chang-Yong;Ko Sang-Cheol
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.18 no.8
    • /
    • pp.635-640
    • /
    • 2006
  • An optimizer has been applied for the optimal design of pipe diameters in the pipe flow network problems. Pipe network flow analysis, which is developed separately, is performed within the interface for the optimization algorithm. A pipe network is chosen for the test, and optimizer GenOpt is applied with Holder-Mead-O'Niell's simplex algorithm after solving the network flow problem by the Newton-Raphson method. As a result, optimally do-signed pipe diameters are successfully obtained which minimize the total design cost. Design cost of pipe flow network can be considered as the sum of pipe installation cost and pump operation cost. In this study, a practical and efficient solution method for the pipe network optimization is presented. Test system is solved for the demonstration of the present optimization technique.

A method to extract the aspherical surface equation from the unknown ophthalmic lens (형상 분석에 의한 안경렌즈의 비구면 계수 추출 방법)

  • 이호철;이남영;김건희;송창규
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.430-433
    • /
    • 2004
  • The ophthalmic lens manufacturing processes need to extract the aspherical surface equation from the unknown surface since its real profile can be adjusted by the process variables to make the ideal curve without the optical aberration. This paper presents a procedure to get the aspherical surface equation of an aspherical ophthalmic lens. Aspherical form generally consists of the Schulz formula to describe its profile. Therefore, the base curvature, conic constant, and high-order polynomial coefficient should be set to the original design equation. To find an estimated aspherical profile, firstly lens profile is measured by a contact profiler, which has a sub-micrometer measurement resolution. A mathematical tool is based on the minimization of the error function to get the estimated aspherical surface equation from the scanned aspherical profile. Error minimization step uses the Nelder-Mead simplex (direct search) method. The result of the refractive power measurement is compared with the curvature distribution on the estimated aspherical surface equation

  • PDF

Nonlinear Blind Equalizer Using Hybrid Genetic Algorithm and RBF Networks

  • Han, Soo-Whan;Han, Chang-Wook
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1689-1699
    • /
    • 2006
  • A nonlinear channel blind equalizer by using a hybrid genetic algorithm, which merges a genetic algorithm with simulated annealing, and a RBF network is presented. In this study, a hybrid genetic algorithm is used to estimate the output states of a nonlinear channel, based on the Bayesian likelihood fitness function, instead of the channel parameters. From these estimated output states, the desired channel states of the nonlinear channel are derived and placed at the center of a RBF equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a conventional genetic algorithm(GA) and a simplex GA, and the relatively high accuracy and fast convergence of the method are achieved.

  • 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