• 제목/요약/키워드: Linear algorithm

검색결과 4,052건 처리시간 0.03초

OPTIMALITY CONDITIONS AND AN ALGORITHM FOR LINEAR-QUADRATIC BILEVEL PROGRAMMING

  • Malhotra, Neelam;Arora, S.R.
    • Management Science and Financial Engineering
    • /
    • 제7권1호
    • /
    • pp.41-56
    • /
    • 2001
  • This linear fractional - quadratic bilevel programming problem, in which the leader's objective function is a linear fractional function and the follower's objective function is a quadratic function, is studied in this paper. The leader's and the follower's variables are related by linear constraints. The derivations of the optimality conditions are based on Kuhn-Tucker conditions and the duality theory. It is also shown that the original linear fractional - quadratic bilevel programming problem can be solved by solving a standard linear fractional program and the optimal solution of the original problem can be achieved at one of the extreme point of a convex polyhedral formed by the new feasible region. The algorithm is illustrated with the help of an example.

  • PDF

이득 설계가 간단한 선형전동기 구동용 고성능 통합 PID 위치제어기 구현 제1부: 통합 PID 위치제어기 특성 (Implementation of the High Performance Unified PID Position Controller for Linear Motor Drive with Easy Gain Ajustment Part I - Feature of the Unified PID Position Controller)

  • 김준석
    • 대한전기학회논문지:전기기기및에너지변환시스템부문B
    • /
    • 제51권4호
    • /
    • pp.187-194
    • /
    • 2002
  • Recently, the application of the linear machine far industrial field is remarkable increased, especially for the gantry machine, machine tool system and CNC. In these application fields, high dynamics position control performance Is essentially required in both the steady and the transient state. This pacer presents simple but powerful position control loop based on traditional PID controller. The presented position control algorithm, named 'Unified PID Position Controller'has great features for the linear machine drives such as no over-shoot phenomena and simple gain tuning strategy. Through the experimental results with commercial linear motors, it is shown that the proposed algorithm has excellent dynamics suitable fur linear motions.

영구자석 여자 횡축형 선형전동기의 추력맥동 저감 제어기법 (Control Method for Minimizing Thrust Ripple of PM Excited Transverse Flux Linear Motor)

  • 안종보;강도현;김지원;정수진;임태윤;박준호
    • 대한전기학회논문지:전기기기및에너지변환시스템부문B
    • /
    • 제53권1호
    • /
    • pp.16-23
    • /
    • 2004
  • Permanent magnet-excited transverse flux linear motor(TFLM) is known to have more excellent ratio of force to weight than any other linear motors. But, thrust generated by phase current is non-linear with regard to current and relative position like switched reluctance motor. This makes current and speed controller design difficult. This paper presents a method on minimization of thrust ripple of permanent magnet-excited transverse flux linear motor. Using genetic algorithm(GA), optimal current waveform can be found under the constraint conditions such as current limit, minimum of ohmic loss and limited rate of change of current etc. The effectiveness is verified through computer simulation and experimental test results.

Activity of a Gifted Student Who Found Linear Algebraic Solution of Blackout Puzzle

  • Lee, Sang-Gu;Park, Jong-Bin;Yang, Jeong-Mo
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제8권3호
    • /
    • pp.215-226
    • /
    • 2004
  • The purpose of this paper is to introduce an activity of student who found purely linear algebraic solution of the Blackout puzzle. It shows how we can help and work with gifted students. It deals with algorithm, mathematical modeling, optimal solution and software.

  • PDF

확장된 일반상한제약을 갖는 이차원 선형계획 배낭문제 연구 (On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB Constrain)

  • 원중연
    • 대한산업공학회지
    • /
    • 제27권1호
    • /
    • pp.25-29
    • /
    • 2001
  • We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

  • PDF

Embeded system을 적용한 Rotary Inverted Pendulum 설계 및 PID에 의한 구현 (Design of Rotary Inverted Pendulum applying an Embedded System and Implementation by PID)

  • 김영춘;김정훈;김영탁;김동한
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(5)
    • /
    • pp.5-8
    • /
    • 2002
  • In this paper, we applied a PC interface and an embedded system in order to design a non-linear system and implement the PID algorithm as our control one. We used the inverted pendulum, one of the most generally used non-linear system models, to control uncertain factors in the environment. This paper showed how to use this non-linear system model to control the factors completely as well as to understand the PID algorithm. Furthermore, this paper applied and understood the embedded system.

  • PDF

ANALYSIS OF A SMOOTHING METHOD FOR SYMMETRIC CONIC LINEAR PROGRAMMING

  • Liu Yong-Jin;Zhang Li-Wei;Wang Yin-He
    • Journal of applied mathematics & informatics
    • /
    • 제22권1_2호
    • /
    • pp.133-148
    • /
    • 2006
  • This paper proposes a smoothing method for symmetric conic linear programming (SCLP). We first characterize the central path conditions for SCLP problems with the help of Chen-Harker-Kanzow-Smale smoothing function. A smoothing-type algorithm is constructed based on this characterization and the global convergence and locally quadratic convergence for the proposed algorithm are demonstrated.

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING BASED ON A SELF-REGULAR PROXIMITY

  • Liu, Zhongyi;Chen, Yue
    • Journal of applied mathematics & informatics
    • /
    • 제29권1_2호
    • /
    • pp.119-133
    • /
    • 2011
  • This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

A HYBRID METHOD FOR REGULARIZED STRUCTURED LINEAR TOTAL LEAST NORM

  • KWON SUNJOO
    • Journal of applied mathematics & informatics
    • /
    • 제18권1_2호
    • /
    • pp.621-637
    • /
    • 2005
  • A hybrid method solving regularized structured linear total least norm (RSTLN) problems, which have highly ill-conditioned coefficient matrix with special structures, is suggested and analyzed. This scheme combining RSTLN algorithm and separation by parts guarantees the convergence of parameters and has an advantages in reducing the residual norm and relative error of solutions. Computational tests for problems arisen in signal processing and image formation process confirm that the presenting method is effective for more accurate solutions to (R)STLN problem than the (R)STLN algorithm.

유전알고리즘을 이용한 전자기 펌프용 선형유도전동기의 최적설계 (Optimum Design of a Linear Induction Motor for Electromagnetic Pump using Genetic Algorithm)

  • 김창업;홍성옥
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 B
    • /
    • pp.744-746
    • /
    • 2000
  • This paper presents an optimum design of a linear induction motor(LIM) using genetic algorithm(GA). Sequential unconstrained minimization technique(SUMT) is used to transform the nonlinear optimization with constraints to a simple unconstrained problem. The objective functions of LIM such as trust, weight are optimized and the result was applied to the design of linear induction pump.

  • PDF