Algorithms for solving large-scale 0–1 goal programming and its application to reliability optimization problem

1989 ◽  
Vol 17 (1-4) ◽  
pp. 525-530 ◽  
Author(s):  
M. Gen ◽  
K. Ida ◽  
M. Sasaki ◽  
J.U. Lee
Author(s):  
Mohamed E. M. El-Sayed ◽  
T. S. Jang

Abstract This paper presents a method for solving large scale structural optimization problems using linear goal programming techniques. The method can be used as a multicriteria optimization tool since goal programming removes the difficulty of having to define an objective function and constraints. It also has the capacity of handling rank ordered design objectives or goals. The method uses finite element analysis, linear goal programming techniques and successive linearization to obtain the solution for the nonlinear goal optimization problems. The general formulation of the structural optimization problem into a nonlinear goal programming form is presented. The successive linearization method for the nonlinear goal optimization problem is discussed. To demonstrate the validity of the method, as a design tool, the solution of the minimum weight structural optimization problem with stress constraints for 10, 25 and 200 truss problems are included.


Author(s):  
Ezzeddine Touti ◽  
Ali Sghaier Tlili ◽  
Muhannad Almutiry

Purpose This paper aims to focus on the design of a decentralized observation and control method for a class of large-scale systems characterized by nonlinear interconnected functions that are assumed to be uncertain but quadratically bounded. Design/methodology/approach Sufficient conditions, under which the designed control scheme can achieve the asymptotic stabilization of the augmented system, are developed within the Lyapunov theory in the framework of linear matrix inequalities (LMIs). Findings The derived LMIs are formulated under the form of an optimization problem whose resolution allows the concurrent computation of the decentralized control and observation gains and the maximization of the nonlinearity coverage tolerated by the system without becoming unstable. The reliable performances of the designed control scheme, compared to a distinguished decentralized guaranteed cost control strategy issued from the literature, are demonstrated by numerical simulations on an extensive application of a three-generator infinite bus power system. Originality/value The developed optimization problem subject to LMI constraints is efficiently solved by a one-step procedure to analyze the asymptotic stability and to synthesize all the control and observation parameters. Therefore, such a procedure enables to cope with the conservatism and suboptimal solutions procreated by optimization problems based on iterative algorithms with multi-step procedures usually used in the problem of dynamic output feedback decentralized control of nonlinear interconnected systems.


Energies ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 2832
Author(s):  
Andrzej J. Osiadacz ◽  
Małgorzata Kwestarz

The major optimization problem of the gas transmission system is to determine how to operate the compressors in a network to deliver a given flow within the pressure bounds while using minimum compressor power (minimum fuel consumption or maximum network efficiency). Minimization of fuel usage is a major objective to control gas transmission costs. This is one of the problems that has received most of the attention from both practitioners and researchers because of its economic impact. The article describes the algorithm of steady-state optimization of a high-pressure gas network of any structure that minimizes the operating cost of compressors. The developed algorithm uses the “sequential quadratic programming (SQP)” method. The tests carried out on the real network segment confirmed the correctness of the developed algorithm and, at the same time, proved its computational efficiency. Computational results obtained with the SQP method demonstrate the viability of this approach.


2016 ◽  
Vol 19 (02) ◽  
pp. 239-252 ◽  
Author(s):  
Morteza Haghighat Sefat ◽  
Khafiz M. Muradov ◽  
Ahmed H. Elsheikh ◽  
David R. Davies

Summary The popularity of intelligent wells (I-wells), which provide layer-by-layer monitoring and control capability of production and injection, is growing. However, the number of available techniques for optimal control of I-wells is limited (Sarma et al. 2006; Alghareeb et al. 2009; Almeida et al. 2010; Grebenkin and Davies 2012). Currently, most of the I-wells that are equipped with interval control valves (ICVs) are operated to enhance the current production and to resolve problems associated with breakthrough of the unfavorable phase. This reactive strategy is unlikely to deliver the long-term optimum production. On the other side, the proactive-control strategy of I-wells, with its ambition to provide the optimum control for the entire well's production life, has the potential to maximize the cumulative oil production. This strategy, however, results in a high-dimensional, nonlinear, and constrained optimization problem. This study provides guidelines on selecting a suitable proactive optimization approach, by use of state-of-the-art stochastic gradient-approximation algorithms. A suitable optimization approach increases the practicality of proactive optimization for real field models under uncertain operational and subsurface conditions. We evaluate the simultaneous-perturbation stochastic approximation (SPSA) method (Spall 1992) and the ensemble-based optimization (EnOpt) method (Chen et al. 2009). In addition, we present a new derivation of the EnOpt by use of the concept of directional derivatives. The numerical results show that both SPSA and EnOpt methods can provide a fast solution to a large-scale and multiple I-well proactive optimization problem. A criterion for tuning the algorithms is proposed and the performance of both methods is compared for several test cases. The used methodology for estimating the gradient is shown to affect the application area of each algorithm. SPSA provides a rough estimate of the gradient and performs better in search environments, characterized by several local optima, especially with a large ensemble size. EnOpt was found to provide a smoother estimation of the gradient, resulting in a more-robust algorithm to the choice of the tuning parameters, and a better performance with a small ensemble size. Moreover, the final optimum operation obtained by EnOpt is smoother. Finally, the obtained criteria are used to perform proactive optimization of ICVs in a real field.


Sign in / Sign up

Export Citation Format

Share Document