This paper describes a linear programming optimization model to minimize the cutting waste in production of steel frames for school tables in a carpentry workshop. School tables are assembled from steel frames, wooden...
详细信息
The problem of structure sub optimality of the rolling stock for removing of the metallurgical plant's finished products fleet is researched in this article, which also supposes methodology of solving this task wi...
详细信息
Hesitant fuzzy sets (HFSs) further extended into interval-valued hesitant fuzzy sets (IVHFSs). IVHFSs comprises belonging degree in terms of intervals. The weights of the criteria are the basic key to decide the best ...
详细信息
Distribution network with a large number of Distributed Generators (DG) puts forward higher requirements for coordinated control of voltage and reactive power. Secondary coordinated voltage control is an effective met...
详细信息
This paper presents a variation of the classical Diet Problem, in which a linear programming model is applied in order to minimize meal costs while meeting the nutritional needs of the individual. With a hybrid applic...
详细信息
This paper presents a variation of the classical Diet Problem, in which a linear programming model is applied in order to minimize meal costs while meeting the nutritional needs of the individual. With a hybrid application of the method Analytic Hierarchy Process (AHP) – by using the software Three Decision Methods (3DM) – and a linear programming (LP) model, the objective of this work was to ensure that 4 previously defined meals were chosen, out of a total of 7, to be part of the menu of a Brazilian company that provides lunch to its employees. With the AHP Method it was possible to determine the preference of employees for each meal, according to a series of criteria, and define a ranking with scores for each one of them. Using these scores, a linear programming model was created whose objective-function was to maximize employee satisfaction with the selected meals, while meeting the maximum cost constraint assigned to this selection. The PL model returned a satisfactory result, in which, counterintuitively, not the 4 meals with the highest score in the application of the AHP method – to maximize satisfaction – nor the 4 cheapest meals – to respect the cost limit – were selected, but a combination of these two characteristics. The methodology proposed in this paper can be applied for the most diverse problems of the public, private or military sectors.
linear programming is a key technique for analysis and verification of numerical properties in programs, neural networks, etc. In particular, in program analysis based on abstract interpretation, many numerical abstra...
详细信息
Telecommunications service providers build highly available networks using equipment redundancy and overload protection mechanisms. However, because of network equipment misconfiguration or a natural disaster, the net...
详细信息
Telecommunications service providers build highly available networks using equipment redundancy and overload protection mechanisms. However, because of network equipment misconfiguration or a natural disaster, the network equipment failover could be unsuccessful. This article proposes a linear programming model for determining the optimal distribution of user sessions in a commercial network such that the impact of an unsuccessful network equipment failover is minimal. The model has been applied successfully during the design of a commercial network that supports approximately 5 million customers. The proposed model will be useful for managing the telecommunication networks in a way that is more robust to catastrophic failure, providing greater security and better service to users. The article also presents quantitative results that show a modest increase in end-to-end one-way speech transmission delay ranging from 3.5 to 8.1 ms. This delay is also known as mouth-to-ear delay. The article proposes improvements to the linear programming model by putting an upper limit on the potential increase in the mouth-to-ear delay.
We provide the first meaningful documentation and analysis of the 'Idiot' crash implemented by Forrest in Clp that aims to obtain an approximate solution to linear programming (LP) problems for warm-starting t...
详细信息
We provide the first meaningful documentation and analysis of the 'Idiot' crash implemented by Forrest in Clp that aims to obtain an approximate solution to linear programming (LP) problems for warm-starting the primal simplex method. The underlying algorithm is a penalty method with naive approximate minimization in each iteration. During initial iterations an approach similar to augmented Lagrangian is used. Later the technique corresponds closely to a classical quadratic penalty method. We discuss the extent to which it can be used to obtain fast approximate solutions of LP problems, in particular when applied to linearizations of quadratic assignment problems.
In this article, we consider a variant of the bandwidth packing problem, in which some demands need to be scheduled within given time windows. The emergence of cloud services has introduced a new challenge to the band...
详细信息
In this article, we consider a variant of the bandwidth packing problem, in which some demands need to be scheduled within given time windows. The emergence of cloud services has introduced a new challenge to the bandwidth packing problem. For example, a typical cloud service network consists of multiple data centres (DCs), and a huge amount of data must be exchanged between DCs to ensure the integrity of the data. This operation is not necessarily real-time, which allows network operators to schedule the demands over time. Motivated by a real-life network service provider in South Korea, we developed a practical heuristic algorithm for the problem. The algorithm utilises an open source linear programming solver. The performance of the proposed algorithm was assessed on the real-life telecommunication network in South Korea. The computational results showed that the proposed approach can provide near-optimal solutions within a short time.
Servo error pre-compensation and feedrate optimization are often performed independently to improve the accuracy and speed of manufacturing machines. However, this independent approach leads to unnecessary trade-offs ...
详细信息
Servo error pre-compensation and feedrate optimization are often performed independently to improve the accuracy and speed of manufacturing machines. However, this independent approach leads to unnecessary trade-offs between productivity and quality in manufacturing. This paper proposes a novel linear programming approach for combined servo error pre-compensation and feedrate optimization, subject to contour error (tolerance) and kinematic constraints. The incorporation of servo error pre-compensation into feedrate optimization allows for faster motions without violating tolerance constraints. Experiments carried out on a 3D printer and precision motion stage are respectively used to demonstrate up to 43% and 47% reduction in cycle time without compromising part quality using the proposed approach compared with the independent approach.
暂无评论