نتایج جستجو برای: nearly optimal programming
تعداد نتایج: 771551 فیلتر نتایج به سال:
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
The purpose of this study is to investigate comparative advantages of corn in comparison with other competitor crops. To do so, Linear Programming, to 2004-2005 data related to classic index (DRC) in Kermanshah province was applied. Results showed that corn has comparative advantages in all regions of Kermanshah province while in optimal cultivation pattern of 37.5 percentages of regions in exi...
In recent years, optimal use of fossil fuels, reduction of environmental pollution and exploitation of renewable energy is one of the most important issues in the policies of different countries, and as you know, Iranchr('39')s electricity industry is dependent on fossil fuel consumption strongly, which causes environmental pollution. The aim of this study is to obtain the optimal combination o...
In recent years, optimal use of fossil fuels, reduction of environmental pollution and exploitation of renewable energy is one of the most important issues in the policies of different countries, and as you know, Iranchr('39')s electricity industry is dependent on fossil fuel consumption strongly, which causes environmental pollution. The aim of this study is to obtain the optimal combination o...
many real water resources optimization problems involve conflicting objectives. in this study, multiobjective genetic algorithm nsga-ii, has been developed for optimization the conjunctive use of surface water and groundwater resources and optimal management of supply and demand of agricultural water. here, optimal allocation of land and water resources to the dominant products in najaf abad pl...
We study the $k$ nearest neighbors problem in plane for general, convex, pairwise disjoint sites of constant description complexity such as line segments, disks, and quadrilaterals under a general family distance functions including $L_p$ norms additively weighted Euclidean distances. compose static data structure this setting with nearly optimal $O(n\log\log n)$ space, $O(\log n+k)$ query time...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید