Fuzzy Heuristics for Sequential Linear Programming

1998 ◽  
Vol 120 (1) ◽  
pp. 17-23 ◽  
Author(s):  
E. L. Mulkay ◽  
S. S. Rao

Numerical implementations of optimization algorithms often use parameters whose values are not strictly determined by the derivation of the algorithm, but must fall in some appropriate range of values. This work describes how fuzzy logic can be used to “control” such parameters to improve algorithm performance. This concept is shown with the use of sequential linear programming (SLP) due to its simplicity in implementation. The algorithm presented in this paper implements heuristics to improve the behavior of SLP based on current iterate values of design constraints and changes in search direction. Fuzzy logic is used to implement the heuristics in a form similar to what a human observer would do. An efficient algorithm, known as the infeasible primal-dual path-following interior-point method, is used for solving the sequence of LP problems. Four numerical examples are presented to show that the proposed SLP algorithm consistently performs better than the standard SLP algorithm.

Author(s):  
Eric L. Mulkay ◽  
Singiresu S. Rao

Abstract Numerical implementations of optimization algorithms often use parameters whose values are not strictly determined by the derivation of the algorithm, but must fall in some appropriate range of values. This work describes how fuzzy logic can be used to “control” such parameters to improve algorithms performance. This concept is shown with the use of sequential linear programming (SLP) due to its simplicity in implementation. The algorithm presented in this paper implements heuristics to improve the behavior of SLP based on current iterate values of design constraints and changes in search direction. Fuzzy logic is used to implement the heuristics in a form similar to what a human observer would do. An efficient algorithm, known as the infeasible primal-dual path-following interior-point method, is used for solving the sequence of LP problems. Four numerical examples are presented to show that the proposed SLP algorithm consistently performs better than the standard SLP algorithm.


2020 ◽  
Vol 188 ◽  
pp. 00002
Author(s):  
Abraham Lomi ◽  
Awan Uji Krismanto ◽  
I Made Wartana ◽  
Dipu Sarkar

A robust sequential primal-dual linear programming formulation for reactive power optimization is developed and discussed in this paper. The algorithm has the characteristic that no approximations or complicate control logic are required in the basic Sequential Linear Programming (SLP) formulation as used by other SLP algorithms reported in the literature. Transmission loss minimization is used as the primary objective. A secondary feasibility improvement objective is used which results in better feasible solution in comparison with the loss minimization objective especially when the initial base case has over voltages. Modification in the proposed method to obtain the limited amount and limited movement of controller solution for real time application is also presented. The algorithm has been tested on Ward and Hale 6-Bus system.


1989 ◽  
Vol 44 (1-3) ◽  
pp. 27-41 ◽  
Author(s):  
Renato D. C. Monteiro ◽  
Ilan Adler

1996 ◽  
Vol 62 (1) ◽  
pp. 173-196
Author(s):  
Tsung-Min Hwang ◽  
Chih-Hung Lin ◽  
Wen-Wei Lin ◽  
Shu-Cherng Fang

2019 ◽  
Vol 3 (1) ◽  
pp. 186-192
Author(s):  
Yudi Wibawa

This paper aims to study for accurate sheet trim shower position for paper making process. An accurate position is required in an automation system. A mathematical model of DC motor is used to obtain a transfer function between shaft position and applied voltage. PID controller with Ziegler-Nichols and Hang-tuning rule and Fuzzy logic controller for controlling position accuracy are required. The result reference explains it that the FLC is better than other methods and performance characteristics also improve the control of DC motor.


2012 ◽  
Vol 22 (03) ◽  
pp. 1250007 ◽  
Author(s):  
PEDRO RODRÍGUEZ ◽  
MARÍA CECILIA RIVARA ◽  
ISAAC D. SCHERSON

A novel parallelization of the Lepp-bisection algorithm for triangulation refinement on multicore systems is presented. Randomization and wise use of the memory hierarchy are shown to highly improve algorithm performance. Given a list of selected triangles to be refined, random selection of candidates together with pre-fetching of Lepp-submeshes lead to a scalable and efficient multi-core parallel implementation. The quality of the refinement is shown to be preserved.


Sign in / Sign up

Export Citation Format

Share Document