Interior Point Methods are widely used to solve linear programming problems. In this work, we present two primal Affine Scaling algorithms to achieve faster convergence in solving linear programming problems. In the f...
详细信息
The Simplex tableau has been broadly used and investigated in the industry and academia. With the advent of the big data era, ever larger problems are posed to be solved in ever larger machines whose architecture type...
详细信息
Solving linear programs by using entropic penalization has recently attracted new interest in the optimization community, since this strategy forms the basis for the fastest-known algorithms for the optimal transport ...
详细信息
Assembling a competitive team is a task encountered in many professional league sports such as cricket, soccer, rugby etc. Teams are assembled annually with players being bid for by competing franchises. While stochas...
详细信息
Assembling a competitive team is a task encountered in many professional league sports such as cricket, soccer, rugby etc. Teams are assembled annually with players being bid for by competing franchises. While stochastic optimization approaches for team selection have been suggested in the past, the approximate nature of these techniques could be disadvantageous for team selection when the stakes are high. In this paper, we explore the use of multi-objective integer programming approach to alleviate this issue and deliver a set of optimal trade-off solutions (teams). We illustrate the performance of the approach using professional Twenty20 cricket league data from the Indian Premier League. We also demonstrate the ability to support partial team construction, i.e., selecting few members of the team with others unchanged. Lastly, we also present a way to rank the importance of the players within a team considering the key objectives.
Traditionally, there are several polynomial algorithms for linear programming including the ellipsoid method, the interior point method and other variants. Recently, Chubanov [Chubanov, 2015] proposed a projection and...
详细信息
At present, the force assignment of communications countermeasure reconnaissance was decided by qualitative analysis method. In view of the limitation of the qualitative decision, minimized force of communications cou...
详细信息
At present, the force assignment of communications countermeasure reconnaissance was decided by qualitative analysis method. In view of the limitation of the qualitative decision, minimized force of communications countermeasure reconnaissance was taken as the objective function, minimized watchers of every time bucket and maximized the duration time on every watcher were taken as the constraint condition, the mathematical model of forces optimization of communications countermeasure reconnaissance was built with linear programming, which was non-standard linear programming. And the mathematical model was solved by simplex method. The result of example showed that the forces optimization of communications countermeasure reconnaissance was valid, and could provide the scientific method for optimization the forces of communications countermeasure reconnaissance.
This paper presents a systematic method to synthesize new finite blocklength converses for the channel coding of asymmetric multiple access channels (A-MAC) from point-to-point converses, by employing the linear progr...
详细信息
ISBN:
(纸本)9781538638224
This paper presents a systematic method to synthesize new finite blocklength converses for the channel coding of asymmetric multiple access channels (A-MAC) from point-to-point converses, by employing the linear programming (LP) based framework in [1]. A direct synthesis yields a converse that extends the Polyanskiy-Poor-Verdú metaconverse to A-MAC. Employing a more sophisticated non-linear synthesis, we derive a new, code-independent converse that is asymptotically tight.
A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically and generally NP-hard computationally ...
详细信息
This paper is concerned with the interval observer for switched system. The frame of interval observer is designed by the theory of positive system and Lyapunov stability, and the aim is to achieve both the positivity...
详细信息
This paper is concerned with the interval observer for switched system. The frame of interval observer is designed by the theory of positive system and Lyapunov stability, and the aim is to achieve both the positivity and exponential stability of the corresponding error system. Different from the current works, multiple linear copositive Lyapunov function is employed for stability analysis and the sufficient conditions for the existence of the interval observer are derived by linear programming forms. Finally, two numerical examples are provided to show the effectiveness of the designed observer.
Smart grid attacks can be applied on a single component or multiple components. The corresponding defense strategies are totally different. In this paper, we investigate the solutions (e.g., linear programming and rei...
详细信息
Smart grid attacks can be applied on a single component or multiple components. The corresponding defense strategies are totally different. In this paper, we investigate the solutions (e.g., linear programming and reinforcement learning) for one-shot game between the attacker and defender in smart power systems. We designed one-shot game with multi-line-switching attack and solved it using linear programming. We also designed the game with single-line-switching attack and solved it using reinforcement learning. The pay-off and utility/reward of the game is calculated based on the generation loss due to initiated attack by the attacker. Defender's defense action is considered while evaluating the pay-off from attacker's and defender's action. The linear programming based solution gives the probability of choosing best attack actions against different defense actions. The reinforcement learning based solution gives the optimal action to take under selected defense action. The proposed game is demonstrated on 6 bus system and IEEE 30 bus system and optimal solutions are analyzed.
暂无评论