نتایج جستجو برای: bi level linear programming
تعداد نتایج: 1789323 فیلتر نتایج به سال:
Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches BES expansion planning MGs are computationally complicated. This work proposes data-driven bi-level multi-period framework to determine siting, sizing, timing installations. The proposed unifies deep reinforcement learning (DRL) line...
fuzzy linear programming problem occur in many elds such as mathematical modeling, control theory and management sciences, etc. in this paper we focus on a kind of linear programming with fuzzy numbers and variables namely fully fuzzy linear programming (fflp) problem, in which the constraints are in inequality forms. then a new method is proposed to ne the fuzzy solution for solving (fflp). ...
using the mathematic techniques such as fuzzy approach has useful outcomes for production planning in different sources. in this paper lgp1 was used to model the objectives such as: avoidance of shortage or surplus of demand, access to maximum of income, using the normal capacity of production and organizing the inventory of warehouse, within the framework of goal constraints like balancing be...
The paper presents an approach to bi-level programming using a duality gap-penalty function format. A new exact penalty function exists for obtaining a global optimal solution for the linear case, and an algorithm is given for doing this, making use of some new theoretical properties. For each penalty parameter value, the central optimisation problem is one of maximising a convex function over ...
In the ofice. it is often ecessary to scan a picture at a certain resolution and then reproduce it at a different (usually higher) resolution. This conversion can be achieved by interpolating the scanned signal between the sample intervals. This paper discusses a class of linear interpolating methods based on resampling polynomial functions. In addition, we introduce new methods to compare the ...
This paper studies the relationship between the so-called bi-quadratic optimization problem and its semidefinite programming (SDP) relaxation. It is shown that each r -bound approximation solution of the relaxed bi-linear SDP can be used to generate in randomized polynomial time an O(r)-approximation solution of the original bi-quadratic optimization problem, where the constant in O(r) does not...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید