• Title/Summary/Keyword: Sequential linear programming

Search Result 94, Processing Time 0.023 seconds

Problem Solution of Linear Programming based Neural Network

  • Son, Jun-Hyug;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2004.05a
    • /
    • pp.98-101
    • /
    • 2004
  • Linear Programming(LP) is the term used for defining a wide range of optimization problems in which the objective function to be minimized or maximized is linear in the unknown variables and the constraints are a combination of linear equalities and inequalities. LP problems occur in many real-life economic situations where profits are to be maximized or costs minimized with constraint limits on resources. While the simplex method introduced in a later reference can be used for hand solution of LP problems, computer use becomes necessary even for a small number of variables. Problems involving diet decisions, transportation, production and manufacturing, product mix, engineering limit analysis in design, airline scheduling, and so on are solved using computers. This technique is called Sequential Linear Programming (SLP). This paper describes LP's problems and solves a LP's problems using the neural networks.

  • PDF

Assessment of Total Transfer Capability for Congestion Management using Linear Programming (선형계획기반 선로혼잡처리에 대한 총송전용량 평가)

  • Kim, Kyu-Ho;Song, Kyung-Bin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.11
    • /
    • pp.447-452
    • /
    • 2006
  • This paper presents a scheme to solve the congestion problem with phase-shifting transformer(PST) controls and power generation controls using linear programming method. A good design of PST and power generation control can improve total transfer capability(TTC) in interconnected systems. This paper deals with an application of optimization technique for TTC calculation. Linear programming method is used to maximize power flow of tie line subject to security constraints such as voltage magnitude and real power flow in interconnected systems. The results are compared with that of repeat power flow(RPF) and sequential quadratic programming(SQP). The proposed method is applied to 10 machines 39 buses model systems to show its effectiveness.

Optimal Design of Helicopter Tailer Boom (헬리곱터 꼬리 날개의 최적 설계)

  • 한석영
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.419-424
    • /
    • 1999
  • In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.

  • PDF

For-loop for Logic Programming (논리 프로그래밍을 위한 for-loop 구문)

  • Kwon, Kee-Hang;Ha, Hong-Pyo
    • The KIPS Transactions:PartA
    • /
    • v.19A no.1
    • /
    • pp.69-72
    • /
    • 2012
  • Logic programming based on classical or linear logic has traditionally lacked devices for expressing sequential tasks and sequential iterative tasks. Expressing sequential goal tasks has been addressed by a recent proposal of sequential goals of the form $G_1{\cap}G_2$ which is based on the game semantics of Japaridze. This paper proposes sequential iterative goal formulas of the form ${\cap}_x^LG$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. ${\cap}_x^L$ is called a sequential bounded quantier. These goals allow us to specify the following task: sequentially iterate $G$ with $x$ ranging over all the elements of $L$.

Combined Optimal Design of Flexible Beam with Sliding Mode Control System

  • Park, Jung-Hyen;Kim, Soon-Ho
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.4
    • /
    • pp.59-65
    • /
    • 2003
  • In order to achieve the desired lightweight and robust design of a structure, it is preferable to design a structure and its control system, simultaneously, which is termed the combined optimal design. A constant-cross-sectional area cantilever beam was chosen as the optimum design method, An initial load and a time-varying disturbance were applied at the free end of the beam. Sliding mode control was selected, due to its insensitivity to the disturbance, compared with other modes. It is known that the sliding mode control is robust to the disturbance and is uncertain, only if a matching condition is met, after giving a switching hyper plane. In this study, the optimum method was used for the design of the switching hyper plane, and the objective function of the optimum switching hyper plane was assumed to be the objective of the control system. The total weight of the structure was treated as a constraint, and the cross sectional areas of the beam were considered as design variables, the result being a nonlinear programming problem. To solve it, the sequential linear programming method was applied. As a result of the optimum design, the effect of attenuating vibrations has been substantially improved. Moreover, the lightweight design of the structure became possible as a result of the relationship of the weight of the structure to the control objective function.

Combined Optimal Design of Structure-Control Systems by Sliding Mode Control (슬라이딩모드 제어 기법을 이용한 구조-제어 시스템의 통합 최적 설계)

  • Park, Jung-Hyeon
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.10
    • /
    • pp.45-51
    • /
    • 2002
  • To achieve the lightweight and robust design of a structure, it is requested to design a structure and its control system simultaneously, which is called as the combined optimal design. A constant-cross-sectional area cantilever beam was chosen as an example for the applying the optimum design method. An initial load and a time varying disturbance were applied at the free end of the beam. Sliding mode control was selected due to its insensitiveness to the disturbance compared with other modes. It is known that the sliding mode control is robust to the disturbance and the uncertainty only if a matching condition is met, after giving a switching hyper plane. In this study, the optimum method was used for the design of the switching hyper plane and the objective function of the optimum switching hyper plane was assumed to be the objective one of the control system. The total weight of the structure was treated as a constraint and the cross sectional areas of the beam were considered as design variables, which means a nonlinear programming problem. The sequential linear programming method was applied to solve it. As a result of the optimum design, the effect of attenuating vibrations has been improved obviously. Moreover, lightweight design of the structure became possible from the relationship of the weight of the structure and the control objective function.

Study on the Optimal Posture for Redundant Robot Manipulators Based on Decomposed Manipulability (분리된 조작도를 이용한 여유자유도 로봇의 최적 자세에 관한 연구)

  • 이지홍;원경태
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.3
    • /
    • pp.249-256
    • /
    • 1999
  • The conventional robot manipulability is decomposed into linear manipulability and angular manipulability so that they may be analysed and visualized in easy way even in the case of 3 dimensional task space with 6 variables. After the Jacobian matrix is decomposed into linear part and angular part, constraint on joint velocities is transformed into linear task velocity and angular task velocity through the decomposed Jacobian matrices. Under the assumption of redundant robot manipulators, several optimization problems which utilize the redundancy are formulated to be solved by linear programming technique or sequential quadratic programming technique. After deriving the solutions of the optimization problems, we give graphical interpretations for the solutions.

  • PDF

Optimal design of a Linear Active Magnetic Bearing using Halbach magnet array for Magnetic levitation (자기부상용 Halbach 자석 배열을 이용한 선형 능동자기 베어링의 최적설계)

  • Lee, Hakjun;Ahn, Dahoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.1
    • /
    • pp.792-800
    • /
    • 2021
  • This paper presents a new structure for a linear active magnetic bearing using a Halbach magnet array. The proposed magnetic bearing consisted of a Halbach magnet array, center magnet, and single coil. The proposed linear active magnetic bearing has a high dynamic force compared to the previous study. The high dynamic force could be obtained by varying the thickness of a horizontally magnetized magnet. The new structure of Halbach linear active magnetic bearing has a high dynamic force. Therefore, the proposed linear active magnetic bearing increased the bandwidth of the system. Magnetic modeling and optimal design of the new structure of the Halbach linear active magnetic bearing were performed. The optimal design was executed on the geometric parameters of the proposed linear active magnetic bearing using Sequential Quadratic Programming. The proposed linear active magnetic bearing had a static force of 45.06 N and a Lorentz force constant of 19.54 N/A, which is higher than previous research.

THE OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE ALL HINGE VERTICES ON INTERVAL GRAPHS

  • Bera, Debashis;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.2
    • /
    • pp.387-401
    • /
    • 2001
  • If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

Study on the Development of an Optimal Hull Form

  • Cho Hee-Jong;Lee Gyoung-Woo;Youn Soon-Dong;Chun Ho-Hwan
    • Journal of Navigation and Port Research
    • /
    • v.29 no.7
    • /
    • pp.603-609
    • /
    • 2005
  • This paper presents the method for developing an optimum hull form with minimum wave resistance using SQP( sequential quadratic programming) as an optimization technique. The wave resistance is evaluated by a Rankine source panel method with non-linear free surface conditions and the ITTC 1957 friction line is used to predict the frictional resistance coefficient. The geometry of the hull surface is represented and modified using NURBS(Non-Uniform Rational B-Spline) surface patches. To verify the validity of the developed program the numerical calculations for Wigley hull and Series 60 Cb=0.6 hull are performed and the results obtained after the numerical calculations are compared with the initial hulls.