This study discusses the production planning system and scheduling shallots planting patterns using fuzzy time series and linear programming methods. In this study fuzzy time series to predict the number of requests a...
详细信息
Micro Grid(MG)s accommodate a variety of Distributed Energy Resource(DER)s and various types of energy users. Energy Storage System(ESS)s are used to alleviate mismatch between distributed generations and loads due to...
详细信息
ISBN:
(数字)9781728167589
ISBN:
(纸本)9781728199016
Micro Grid(MG)s accommodate a variety of Distributed Energy Resource(DER)s and various types of energy users. Energy Storage System(ESS)s are used to alleviate mismatch between distributed generations and loads due to intermittent nature of DERs. But, this solution suffers from a huge capital investment, and significant energy transfer loss occurs due to inefficiency of charging and discharging processes. On the other hands, there are another way to make direct power transactions between MGs. Transactions between MGs could provide higher efficiency than traditional grid operation methods. In a grid network, tree topology has many advantages over mesh topology. This paper proposes linear programming for minimizing power transaction price in MG network with radial topology.
The aim of this paper is to find a new type of linear programming problems depending on the set Zn (the set of integers modulo n) by using the graphical method. We gave a new definitions that is characterized by the s...
详细信息
In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in term...
详细信息
The non-uniqueness of non-stationary signals is a difficult problem in the restoration of communication signals. We propose a piecewise smooth signal restoration algorithm based on linear programming. By constructing ...
详细信息
ISBN:
(数字)9781728196688
ISBN:
(纸本)9781728196695
The non-uniqueness of non-stationary signals is a difficult problem in the restoration of communication signals. We propose a piecewise smooth signal restoration algorithm based on linear programming. By constructing a total smooth bounded variation model of piecewise smooth signal restoration, the optimization process of the non-differentiable constraint problem is transformed into a nonlinear programming problem with constraints, and the complexity of solving the variation parameter is reduced. Simulation results show that the proposed algorithm is better than the traditional Wiener and Richardson-Lucy restoration methods in signal restoration. In the case of low signal-to-noise ratio (SNR), the algorithm can also reflect the basic information of the original signal.
In the framework of free flight,there can be no intersection between the protected areas of two *** traditional conflict resolution methods allow generally the aircraft to change the speed alone or to change angle ***...
详细信息
In the framework of free flight,there can be no intersection between the protected areas of two *** traditional conflict resolution methods allow generally the aircraft to change the speed alone or to change angle *** from the method of linear programming and based on solving some special problems,this article presents a method that can change the speed and angle of aircraft in the same ***,some tests verify the feasibility of the method.
In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based framework for solving linear programming (LP) in time depending only on the constraint matrix in the bit complexity model. In Tardos's frame...
详细信息
ISBN:
(数字)9781728196213
ISBN:
(纸本)9781728196220
In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based framework for solving linear programming (LP) in time depending only on the constraint matrix in the bit complexity model. In Tardos's framework, one reduces solving the LP min(c, x), Ax=b, x ≥ 0, A Z m×n , to solving O(nm) LPs in A having small integer coefficient objectives and right-hand sides using any exact LP algorithm. This gives rise to an LP algorithm in time poly (n, m log Δ A ), where Δ A is the largest subdeterminant of A. A significant extension to the real model of computation was given by Vavasis and Ye (Math. Prog. '96), giving a specialized interior point method that runs in time poly (n, m,log χ̑ A ), depending on Stewart's χ̑ A , a well-studied condition number. In this work, we extend Tardos's original framework to obtain such a running time dependence. In particular, we replace the exact LP solves with approximate ones, enabling us to directly leverage the tremendous recent algorithmic progress for approximate linear programming. More precisely, we show that the fundamental “accuracy” needed to exactly solve any LP in A is inverse polynomial in n and log χ̑ A . Plugging in the recent algorithm of van den Brand (SODA '20), our method computes an optimal primal and dual solution using O(mn ω+1+0(1) log(χ̑ A +n)) arithmetic operations, outperforming the specialized interior point method of Vavasis and Ye and its recent improvement by Dadush et al (STOC '20). By applying the preprocessing algorithm of the latter paper, the dependence can also be reduced from χ̑ A to χ̑ A *, the minimum value of χ̑ AD attainable via column rescalings. Our framework is applicable to achieve the poly (n, m,log χ̑ A *) bound using essentially any weakly polynomial LP algorithm, such as the ellipsoid method. At a technical level, our framework combines together approximate LP solutions to compute exact ones, making use of constructive proximity theorems-which bound the distance between solutions of “
Consider a learning algorithm, which involves an internal call to an optimization routine such as a generalized eigenvalue problem, a cone programming problem or even sorting. Integrating such a method as a layer(s) w...
详细信息
We develop the linear programming approach to mean-field games in a general setting. This relaxed control approach allows to prove existence results under weak assumptions, and lends itself well to numerical implement...
详细信息
In the framework of free flight, there can be no intersection between the protected areas of two planes. The traditional conflict resolution methods allow generally the aircraft to change the speed alone or to change ...
详细信息
ISBN:
(数字)9781728158556
ISBN:
(纸本)9781728158563
In the framework of free flight, there can be no intersection between the protected areas of two planes. The traditional conflict resolution methods allow generally the aircraft to change the speed alone or to change angle alone. Starting from the method of linear programming and based on solving some special problems, this article presents a method that can change the speed and angle of aircraft in the same time. Finally, some tests verify the feasibility of the method.
暂无评论