نتایج جستجو برای: storage mixed integer linear programming
تعداد نتایج: 1153922 فیلتر نتایج به سال:
We present a generic branch-and-bound algorithm for finding all the Pareto solutions of biobjective mixed-integer linear program. The main contributions are new algorithms obtaining dual bounds at node, checking node fathoming, presolve, and duality gap measurement. Our is predominantly decision space search method because branching performed on variables, akin to single objective problems, alt...
an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...
After a permanent fault occurs if it is not possible to supply the load in the network, the optimal load restoration scheme allows the system to restoration the load with the lowest exit cost, the lowest load interruption, and in the shortest possible time. This article introduces a new design called Smart Load Shedding, abbreviated SLS. In the proposed SLS scheme, the types of devices in smart...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید