نتایج جستجو برای: single objective integer linear programming
تعداد نتایج: 2074296 فیلتر نتایج به سال:
The mixed linear programming model is commonly recognized to be an effective means for searching optimal reservoir operation policy in water resources system. In this paper a multi-objective mixed integer linear programming model is set up to obtain the optimal operation policy of multi-reservoir water supply system during drought, which is able to consider the operation rule of reservoir-group...
We consider integer linear programming problems with a fixed coefficient matrix and varying objective function and right-hand-side vector. Among our results, we show that, for any optimal solution to a linear program max{wx: Ax <~ b}, the distance to the nearest optimal solution to the corresponding integer program is at most the dimension of the problem multiplied by the largest subdeterminant...
In this paper we present an algorithm for determining initial bound for the Branch and Bound (B&B) method. The idea of this algorithm is based on the use of “ray” as introduced in the “ray-method” developed for solving integer linear programming problems [11], [12]. Instead of solving an integer programming problem we use the main idea of the ray-method to find an integer feasible solution of a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید