نتایج جستجو برای: radial convex solution
تعداد نتایج: 569514 فیلتر نتایج به سال:
Many autonomous microgrids have high penetration of distributed generation (DG) units. Optimal power flow (OPF) is necessary for the optimal dispatch such networked (NMGs). Existing convex relaxation methods three-phase OPF are only applicable to radial networks, not meshed networks. To overcome this limitation, we develop a semidefinite programming (SDP) model, which can be applied networks an...
Optimal placement of scattered generator sources in the main and secondary feeders of radial grid reduces energy losses, releases the capacity of existing feeders and improves the existing voltage profile. In this project determine the location and suitable for the production of production resources S cattered in radial feeders of unbalanced distribution networks, a new formulation solution is ...
Noise-corrupted signals and images can be reconstructed by regularization. If discontinuities must be preserved in the reconstruction, a non-convex solution space is implied. The solution of minimum energy can be approximated by the Graduated Non-Convexity (GNC) algorithm. The GNC approximates the non-convex solution space by a convex solution space, and varies the solution space slowly towards...
This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
Optimization problems are not only formed into a linear programming but also nonlinear programming. In real life, often decision variables restricted on integer. Hence, came the nonlinear programming. One particular form of nonlinear programming is a convex quadratic programming which form the objective function is quadratic and convex and linear constraint functions. In this research designed ...
this paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. the main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
The paper deals with the propagation of singularities of semi-convex functions. We obtain lower bounds on the degree of the singularities and on the size of the singular set in a neighborhood of a singular point. These results apply to viscosity solutions of HamiltonJacobi-Bellman equations. In particular, they provide sufficient conditions for the propagation of singularities, depending only o...
Abstract Optimal power flow (OPF) plays an important role in the secure and economical operation of distribution network. This paper proposes a novel generalized linear‐constrained optimal (GLOPF) model for both radial mesh networks, which iteratively approaches solution to original OPF problem. The first‐order Taylor series approximation method is applied linearize non‐linear non‐convex constr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید