this paper presents an approach for the provision of minute reserve capacity products at the German minute reserve market provided by a pool of electric vehicles. therefore, the requirements of prequalification for ma...
详细信息
ISBN:
(纸本)9781509012985
this paper presents an approach for the provision of minute reserve capacity products at the German minute reserve market provided by a pool of electric vehicles. therefore, the requirements of prequalification for market participation have been analyzed and examined with regard to electric vehicle pools. A mixed integer linear programming model has been developed. It ensures the provision and delivery of capacity products in an optimal way, whilst the electric vehicles charging demands are also ensured.
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. this resolves a long-standing open question posed in [Faigle, Kern, Fekete, Hochstattler, Mathemat...
详细信息
ISBN:
(纸本)9783030179533;9783030179526
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. this resolves a long-standing open question posed in [Faigle, Kern, Fekete, Hochstattler, Mathematical programming, 1998].
Command-programming control contours of spacecraft are modelled with Markov chains. these models are used for the preliminary design of spacecraft control system effective structure. Corresponding optimization multi-o...
详细信息
ISBN:
(纸本)9789897581984
Command-programming control contours of spacecraft are modelled with Markov chains. these models are used for the preliminary design of spacecraft control system effective structure. Corresponding optimization multi-objective problems with algorithmically given functions of mixed variables are solved with a special stochastic algorithms called Self-configuring Non-dominated Sorting Genetic Algorithm II, Cooperative Multi-Objective Genetic Algorithm with Parallel Implementation and Co-Operation of Biology Related Algorithms for solving multi-objective integeroptimization problems which require no settings determination and parameter tuning. the high performance of the suggested algorithms is proved by solving real problems of the control contours structure preliminary design.
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. the problem is defined as: Given a data-center, a set of servers wit...
详细信息
ISBN:
(纸本)9783642135194
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. the problem is defined as: Given a data-center, a set of servers with a priori fixed costs, a set of services or applications with hourly resource utilizations, find an allocation of applications to servers while minimizing the data-center costs and satisfying constraints on the resource utilizations for each hour of the day profile and on rule-based constraints defined between services and servers and amongst different services. the service consolidation problem can be modelled as an integer Linear programming problem with 0-1 variables, however it is extremely difficult to handle large sized instances and the rule-based constraints. So a constraint programming approach using the COMET programming language is developed to assess the impact of the rule-based constraints in reducing the problem search space and to improve the solution quality and scalability. Computational results for realistic consolidation scenarios are presented, showing that the proposed approach is indeed promising.
In this paper we introduce the two-stage stochastic graph partitioning problem and present the stochastic mixed integerprogramming formulation for this problem with finite explicit scenarios. For solving this problem...
详细信息
ISBN:
(纸本)9783642226151
In this paper we introduce the two-stage stochastic graph partitioning problem and present the stochastic mixed integerprogramming formulation for this problem with finite explicit scenarios. For solving this problem, we present an equivalent integer linear programming formulation where some binary variables are relaxed to continuous ones. Additionally, for some specific graphs, we present a more simplified linear programming formulation. All formulations are tested on randomly generated graphs with different densities and different numbers of scenarios.
In the cutting stock problem we are given a set T of object types, where objects of type T-i is an element of T have integer length p(i) > 0. Given a set O of n objects containing n(i) objects of type T-i, for each...
详细信息
ISBN:
(纸本)9783642130359
In the cutting stock problem we are given a set T of object types, where objects of type T-i is an element of T have integer length p(i) > 0. Given a set O of n objects containing n(i) objects of type T-i, for each i = 1, ..., d, the problem is to pack O into the minimum number of bins of capacity beta. In this paper we consider the version of the problem in which the number d of different object types is constant and we present an algorithm that computes a solution using at most OPT + 1 bins, where OPT is the value of an optimum solution.
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing o...
详细信息
ISBN:
(纸本)9783642130359
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the variables using suitably-defined lattice-free ellipsoids. Experiments show that our approach is very fast on both unconstrained problems and problem us with box constraints. the main reason is that all expensive calculations can be done in a preprocessing phase, while a single node in the enumeration tree can be processed in linear time in the problem dimension.
We generalize the reduction mechanism between linear programming problems from [1] in two ways (1) relaxing the requirement of affineness, and (2) extending to fractional optimization problems. As applications we prov...
详细信息
ISBN:
(纸本)9783319334615;9783319334608
We generalize the reduction mechanism between linear programming problems from [1] in two ways (1) relaxing the requirement of affineness, and (2) extending to fractional optimization problems. As applications we provide several new LP-hardness and SDP-hardness results, e.g., for the SparsestCut problem, the BalancedSeparator problem, the MaxCut problem and the Matching problem on 3-regular graphs. We also provide a new, very strong Lasserre integrality gap for the IndependentSet problem, which is strictly greater than the best known LP approximation, showing that the Lasserre hierarchy does not always provide the tightest SDP relaxation.
the Nemhauser-Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that ass...
详细信息
ISBN:
(纸本)9783030457716;9783030457709
the Nemhauser-Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that assigns integer values to some variables, there exists an optimal integer solution in which these variables retain the same values. While the standard LP is defined by only non-negativity and edge constraints, a variety of stronger LP formulations have been studied and one may wonder whether any of them has the this property as well. We show that any stronger LP formulation that satisfies mild conditions cannot have the persistency property on all graphs, unless it is always equal to the stable-set polytope.
this note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition algorithm for the separable convex function minimization problems helps us give simple sufficient co...
详细信息
ISBN:
(纸本)9783540727910
this note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition algorithm for the separable convex function minimization problems helps us give simple sufficient conditions for the rationality of optimal solutions and that it leads us to some interesting properties, including the equivalence of the lexicographically optimal base problem, introduced by Fujishige, and the submodular utility allocation market problem, introduced by Jain and Vazirani. In addition, we develop an efficient implementation of the decomposition algorithm via parametric submodular function minimization algorithms. Moreover, we show that, in some remarkable cases, non-separable convex optimization problems over base polytopes can be solved in strongly polynomial time.
暂无评论