نتایج جستجو برای: non linear programming
تعداد نتایج: 1958695 فیلتر نتایج به سال:
in this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
بارزدایی بهینه در شرایط اضطراری یکی از مسایل مهم در برنامه ریزی، امنیت و بهره برداری از سیستمهای قدرت می باشد. بارزدایی برای جلوگیری از پدیده هایی از قبیل فروپاشی ولتاژ و اضافه بار خطوط که می توانند منجر به خروجهای پشت سر هم و در نهایت خاموشی سیستم گردد لازم و ضروری است. در این پایان نامه یک شیوه بارزدایی جدید ارایه می شود ؛ یکی از ویژگیهای مهم این روش این است که مقدار بار حذف شده از هر شینه مش...
presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...
zinc is the first modelling language which supports solver and technique independence. this means that a high level conceptual model can be automatically mapped into an appropriate low level design model for a specific solver or technique. to date, zinc uses three different techniques to solve a model: constraint programming (cp), local search (ls), and mixed integer programming (mip). in this ...
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید