• Title/Summary/Keyword: Optimal Programming

Search Result 1,338, Processing Time 0.027 seconds

Design of digital filters using linear programming (선형 프로그래밍에 의한 디지탈 필터의 설계)

  • 조성현;임화영
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1986.10a
    • /
    • pp.137-141
    • /
    • 1986
  • This paper presents optimal recursive digital filter design to meet simultaneous specifications of magnitude and linear phase characteristics. As is well known, the overshoot in the vicinity of discontinuity is hight. The technique using linear programming (the dual programming) is choosing more specification points in the vicinity of band limit frequency. The resulting filter can shown improved response and numerical accuracy with reduced nonuniform specification points in frequency domain.

  • PDF

An Optimal Solution of Machine Cell Formation Problem (기계 그룹 형성 문제의 최적해)

  • Choi Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.27 no.3
    • /
    • pp.7-13
    • /
    • 2004
  • In this paper, machine cell formation problem is discussed. To reflect precisely actual manufacturing situations such as routing sequences, production quantities, and machining (or operation) characteristics, a new network presentation (or the problem is proposed. It is formulated as a simple 0-1 quadratic programming model with linear constraints. Then, the model is converted into a 0-1 integer programming model using a variable transformation technique. Lastly, some computational results are presented.

The Maximin Linear Programming Knapsack Problem With Extended GUB Constraints (확장된 일반상한제약을 갖는 최대최소 선형계획 배낭문제)

  • 원중연
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.3
    • /
    • pp.95-104
    • /
    • 2001
  • In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

  • PDF

Routing and Collision Avoidance of Linear Motor based Transfer Systems using Online Dynamic Programming

  • Kim, Jeong-Tae;Cho, Hyun-Cheol;Lee, Kwon-Soon
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.393-397
    • /
    • 2006
  • Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using dynamic programming (DP). The proposed DP is accomplished online for determining optimal paths for each shuttle car. We apply our algorithm to Agile port terminal in USA.

  • PDF

Optimal Geometric Path and Minimum-Time Motion for a Manipulator Arm (로봇팔의 최적 기하학적 경로 및 시간최소화 운동)

  • Park, Jong-Keun;Han, Sung-Hyun;Kim, Tae-Han;Lee, Sang-Tak
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.12
    • /
    • pp.204-213
    • /
    • 1999
  • This paper suggests a numerical method of finding optimal geometric path and minimum-time motion for a manipulator arm. To find the minimum-time motion, the optimal geometric path is searched first, and the minimum-time motion is searched on this optimal path. In the algorithm finding optimal geometric path, the objective function is minimizing the combination of joint velocities, joint-jerks, and actuator forces as well as avoiding several static obstacles, where global search is performed by adjusting the seed points of the obstacle models. In the minimum-time algorithm, the traveling time is expressed by the linear combinations of finite-term quintic B-splines and the coefficients of the splines are obtained by nonlinear programming to minimize the total traveling time subject to the constraints of the velocity-dependent actuator forces. These two search algorithms are basically similar and their convergences are quite stable.

  • PDF

Optimal Operation Control for Energy Saving in Water Reuse Pumping System (에너지절감을 위한 물 재이용 펌프시스템의 최적운전 제어)

  • Boo, Chang-Jin;Kim, Ho-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.5
    • /
    • pp.2414-2419
    • /
    • 2012
  • This paper presents an optimal operation control method for energy saving in the water reuse pumping system. A predictive horizon switching strategy is proposed to implement an optimal operation control and a linear programming (LP) algorithm is used to solve optimal problems in each time step. Energy costs are calculated for electricity on both TOU in the light, heavy, and maximum load time period and peak charges. The optimal operation in water reuse pumping systems is determined to reduce the TOU and peak costs. The simulation results show a power energy saving for water reuse pumping systems and power stability improvement.

A Two-stage Stochastic Programming Model for Optimal Reactive Power Dispatch with High Penetration Level of Wind Generation

  • Cui, Wei;Yan, Wei;Lee, Wei-Jen;Zhao, Xia;Ren, Zhouyang;Wang, Cong
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.53-63
    • /
    • 2017
  • The increasing of wind power penetration level presents challenges in classical optimal reactive power dispatch (ORPD) which is usually formulated as a deterministic optimization problem. This paper proposes a two-stage stochastic programming model for ORPD by considering the uncertainties of wind speed and load in a specified time interval. To avoid the excessive operation, the schedule of compensators will be determined in the first-stage while accounting for the costs of adjusting the compensators (CACs). Under uncertainty effects, on-load tap changer (OLTC) and generator in the second-stage will compensate the mismatch caused by the first-stage decision. The objective of the proposed model is to minimize the sum of CACs and the expected energy loss. The stochastic behavior is formulated by three-point estimate method (TPEM) to convert the stochastic programming into equivalent deterministic problem. A hybrid Genetic Algorithm-Interior Point Method is utilized to solve this large-scale mixed-integer nonlinear stochastic problem. Two case studies on IEEE 14-bus and IEEE 118-bus system are provided to illustrate the effectiveness of the proposed method.

Optimal Control of Multireservoirs Using Discrete Laguerre Polynomials (Laguerre Polynomial을 이용한 저수지군의 최적제어)

  • Lee, Jae Hyoung;Kim, Min Hwan
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.11 no.4
    • /
    • pp.91-102
    • /
    • 1991
  • Traditionally, a dynamic programming(DP) technique has been used to the multireservoir control system. The algorithm has inherent problem to increase computational requirements exponentially due to discretization of variables and expanding the dimension of the system. To solve this problem, this paper describes transforming the optimal control system into a quadratic programming(QP), using Laguerre polynomials(LP) and its properties. The objective function of the proposed QP is independent of time variable. The solution of the QP is obtained by nonlinear programming(NLP) using augmented Lagrangian multiplier method. The numerical experiment shows that the water level of reservoirs is higher than Lee's and the evaluated benefit value is about the same as other researcher's.

  • PDF

Dynamic Behavioral Prediction of Escherichia coli Using a Visual Programming Environment (비쥬얼 프로그래밍 환경을 이용한 Escherichia coli의 동적 거동 예측)

  • Lee, Sung-Gun;Hwang, Kyu-Suk;Kim, Cheol-Min
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2004.11a
    • /
    • pp.39-49
    • /
    • 2004
  • When there is a lack of detailed kinetic information, dFBA(dynamic flux balance analysis) has correctly predicted cellular behavior under given environmental conditions with FBA and different ial equations. However, until now, dFBA has centered on substrate concentration, cell growth, and gene on/off, but a detailed hierarchical structure of a regulatory network has not been taken into account. For this reason, the dFBA has limited the represen tation of interactions between specific regulatory proteins and genes and the whole transcriptional regulation mechanism with environmental change. Moreover, to calculate optimal metabolic flux distribution which maximizes the growth flux and predict the b ehavior of cell system, linear programming package(LINDO) and spreadsheet package(EXCEL) have been used simultaneously. thses two software package have limited in the visual representation of simulation results and it can be difficult for a user to look at the effects of changing inputs to the models. Here, we descirbes the construction of hierarchical regulatory network with defined symbolsand the development of an integrated system that can predict the total control mechanism of regulatory elements (opero ns, genes, effectors, etc.), substrate concentration, growth rate, and optimal flux distribution with time. All programming procedures were accoplished in a visual programming environment (LabVIEW).

  • PDF

Comparative and Combined Performance Studies of OpenMP and MPI Codes (OpenMP와 MPI 코드의 상대적, 혼합적 성능 고찰)

  • Lee Myung-Ho
    • The KIPS Transactions:PartA
    • /
    • v.13A no.2 s.99
    • /
    • pp.157-162
    • /
    • 2006
  • Recent High Performance Computing (HPC) platforms can be classified as Shared-Memory Multiprocessors (SMP), Massively Parallel Processors (MPP), and Clusters of computing nodes. These platforms are deployed in many scientific and engineering applications which require very high demand on computing power. In order to realize an optimal performance for these applications, it is crucial to find and use the suitable computing platforms and programming paradigms. In this paper, we use SPEC HPC 2002 benchmark suite developed in various parallel programming models (MPI, OpenMP, and hybrid of MPI/OpenMP) to find an optimal computing environments and programming paradigms for them through their performance analyses.