APPROXIMATE LAGRANGE MULTIPLIER ALGORITHM FOR STOCHASTIC PROGRAMS WITH COMPLETE RECOURSE:NONLINEAR DETERMINISTIC CONSTRAINTS

In this paper we design an approximation method for solving stochastic programs with com-plete recourse and nonlinear deterministic constraints. This method is obtained by combiningapproximation method and Lagrange multiplier algorithm of Bertsekas type. Thus this methodhas the advantages of both the two.

Solution of Combined Heat and Power Economic Dispatch Problem Using Direct Optimization Algorithm

This paper presents the solution to the combined heat and power economic dispatch problem using a direct solution algorithm for constrained optimization problems. With the potential of Combined Heat and Power (CHP) production to increase the efficiency of power and heat generation simultaneously having been researched and established, the increasing penetration of CHP systems, and determination of economic dispatch of power and heat assumes higher relevance. The Combined Heat and Power Economic Dispatch (CHPED) problem is a demanding optimization problem as both constraints and objective functions can be non-linear and non-convex. This paper presents an explicit formula developed for computing the system-wide incremental costs corresponding with optimal dispatch. The circumvention of the use of iterative search schemes for this crucial step is the innovation inherent in the proposed dispatch procedure. The feasible operating region of the CHP unit three is taken into account in the proposed CHPED problem model, whereas the optimal dispatch of power/heat outputs of CHP unit is determined using the direct Lagrange multiplier solution algorithm. The proposed algorithm is applied to a test system with four units and results are provided.

Study of Array Antenna Pattern Synthesis Based on Sparse Sensing

Aiming at the problem that a large number of array elements are needed for uniform arrays to meet the requirements of direction map,a sparse array pattern synthesis method is proposed in this paper based on the sparse sensing theory.First,the Orthogonal Matching Pursuit(OMP)algorithm and the Exact Augmented Lagrange Multiplier(EALM)algorithm were improved in the sparse sensing theory to obtain a more efficient Orthogonal Multi⁃Matching Pursuit(OMMP)algorithm and the Semi⁃Exact Augmented Lagrange Multiplier(SEALM)algorithm.Then,the two improved algorithms were applied to linear array and planar array pattern syntheses respectively.Results showed that the improved algorithms could achieve the required pattern with very few elements.Numerical simulations verified the effectiveness and superiority of the two synthetic methods.In addition,compared with the existing sparse array synthesis method,the proposed method was more robust and accurate,and could maintain the advantage of easy implementation.