Optimal Linear Programming Solutions for Multiprocessor Scheduling with Communication Delays

Author(s):  
Sarad Venugopalan ◽  
Oliver Sinnen
2012 ◽  
Vol 51 (1) ◽  
pp. 11-21
Author(s):  
Jaromír Antoch ◽  
Michal Černý ◽  
Milan Hladík

ABSTRACT Recent complexity-theoretic results on finding c-optimal designs over finite experimental domain X are discussed and their implications for the analysis of existing algorithms and for the construction of new algorithms are shown. Assuming some complexity-theoretic conjectures, we show that the approximate version of c-optimality does not have an efficient parallel implementation. Further, we study the question whether for finding the c-optimal designs over finite experimental domain X there exist a strongly polynomial algorithms and show relations between considered design problem and linear programming. Finally, we point out some complexity-theoretic properties of the SAC algorithm for c-optimality.


2018 ◽  
Vol 1 (1) ◽  
Author(s):  
Ria Asysyfa Hasmi

One purpose is to review company get advantages The Maximum and minimum cover charge thing. Many HAL should be made for a review of A Company Posted achieve these objectives, ie only prayer is how to determine Products Should TYPE WITH generated utilizing existing resources thus able to contribute Maximum AGRO. Company Must Develop CAN BE Meticulously Term Planning Production will be produced for review optimize profits WITH take into account factors such as the production of raw materials. When Paid Products produced too big Namely State exceeds the demand limit, then HAL husband will result in inaccuracies allocate factors of production is owned, thereby increasing the cost of production includes. Here Writers Wanted Looking for an alternative solution to a review AS WITH planned increase profits Production WITH progamming optimal linear method.The findings of The TIN using software TORA BY TYPE findings For green bread, CV. Aceh Bakery Must be producing as much as 152 packs / day. For TYPE bread Skinless, CV. Aceh Bakery Must be producing as much as 149 packs / day. For TYPE crusted bread, CV. Aceh Bakery Must be producing 150 packs / day. Article Search Google so, then CV. Aceh Bakery will get a profit of Rp.1.973.100, - / day.Keyword : Roti, Optimization, Linier Proggramming, TORA.


2011 ◽  
Vol 8 (1) ◽  
pp. 346163
Author(s):  
Jiří Trdlička ◽  
Zdeněk Hanzálek

This work proposes a novel in-network distributed algorithm for real-time energy optimal routing in ad hoc and sensor networks for systems with linear cost functions and constant communication delays. The routing problem is described as a minimum-cost multicommodity network flow problem by linear programming and modified by network replication to a real-time aware form. Based on the convex programming theory we use dual decomposition to derive the distributed algorithm. Thanks to the exact mathematical derivation, the algorithm computes the energy optimal real-time routing. It uses only peer-to-peer communication between neighboring nodes and does not need any central node or knowledge about the whole network structure. Each node knows only the produced and collected data flow and the costs of its outgoing communication links. According to our knowledge, this work is the first, which solves the real-time routing problem with linear cost functions and constant communication delays, using the dual decomposition.


2009 ◽  
Vol 19 (1) ◽  
pp. 123-132 ◽  
Author(s):  
Nikolaos Samaras ◽  
Angelo Sifelaras ◽  
Charalampos Triantafyllidis

The aim of this paper is to present a new simplex type algorithm for the Linear Programming Problem. The Primal - Dual method is a Simplex - type pivoting algorithm that generates two paths in order to converge to the optimal solution. The first path is primal feasible while the second one is dual feasible for the original problem. Specifically, we use a three-phase-implementation. The first two phases construct the required primal and dual feasible solutions, using the Primal Simplex algorithm. Finally, in the third phase the Primal - Dual algorithm is applied. Moreover, a computational study has been carried out, using randomly generated sparse optimal linear problems, to compare its computational efficiency with the Primal Simplex algorithm and also with MATLAB's Interior Point Method implementation. The algorithm appears to be very promising since it clearly shows its superiority to the Primal Simplex algorithm as well as its robustness over the IPM algorithm.


Sign in / Sign up

Export Citation Format

Share Document