Papers by Keyword: Linear Programming

Paper TitlePage

Authors: Hai Jun Chen, Xiao Ling Liu, Ling Hui Liu
Abstract: The least squares method is very sensitive to outliers, one of the simple alternative is the least absolute deviation, i.e. L1 regression, which is less sensitive to outliers, so which is more suitable the small sample and much noise situation. In this paper, the L1 problem of linear model is discussed, the previous work is reviewed systematically, different algorithms is compared, it is proved that the dual forms of different algorithms are the same.
Authors: Can Tao Shi, Zi Sheng Liu, Yu Zhuo Liu, Yong Liang Zhou
Abstract: Concentrating on byproduct gas system with multiple pipeline networks, this paper established a mathematical model for byproduct gas scheduling (BGS) problem in iron and steel enterprises with consideration of supply priorities of consumption units. A decomposition algorithm is employed to transform the original model into an integer programming and a linear programming. The genetic algorithm is introduced as the solution mainframe to solve the integer programming problem and the linear programming problem iteratively. The result of practical-data-based experiment indicates that the proposed model and algorithm are feasible and effective.
Authors: X.Y. Guo, Guo Hua Qin, Hai Chao Ye
Abstract: After being located, cutting force and torques will exert on a workpiece during the machining operation. In order to guarantee the location accuracy and production safety, the feasible clamping forces must be planned to stabilize the workpiece in the entire processing. Therefore, the workpiece stability is taken as a core to create a deterministic algorithm to the application region of clamping forces for the complex workpiece. Firstly, on the basis of the combination of the screw theory with the linear programming technology, an analysis algorithm is subjected to judge the workpiece stability. Secondly, according to the surface discretization method, a deterministic algorithm is further established to plan the application region of clamping force by analyzing the workpiece stability at all nodes in sequence. The proposed method can be utilized for the determination of the application region of clamping forces as well as the verification of the feasibility of the magnitudes of clamping forces.
Authors: Xing Chun Li, Jing Ya Wen, Jiang Long, Xian Yuan Du, Yu Li
Abstract: On account of severe water pollution condition, this paper combines refinery and chemical enterprises pollution reduction and linear programming method, builds a selection optimization model of water pollution emission reduction measures in refining and chemical enterprises, and puts the above model into practice to validate its validity and reliability. According to the case study, the maximum emission reductions of COD and NH3-N for refining and chemical enterprises was 6481.50 and 549.51tons, which has improved 29.63% and 9.90% compared with the target reductions, respectively. The optimal emission reduction scheme is choosing MycelxTM technology, and COD has installed on the Delay catalytic unit, while NH3-N has installed on the Sulfur recovery unit. This model could provide not only the maximum emission reduction and optimal scheme, but also the decision support of emission reduction for refinery and chemical enterprises during "the 12th Five-Year Plan".
Authors: J.A. Fakharzadeh, F.N. Jafarpoor
Abstract: The mean idea of this paper is to present a new combinatorial solution technique for the controlled vibrating circle shell systems. Based on the classical results of the wave equations on circle domains, the trajectory is considered as a finite trigonometric series with unknown coefficients in polar coordinates. Then, the problem is transferred to one in which its unknowns are a positive Radon measure and some positive coefficients. Extending the underlying space helps us to prove the existence of the solution. By using the density properties and some approximation schemes, the problem is deformed into a finite linear programming and the nearly optimal trajectory and control are identified simultaneously. A numerical example is also given.
Authors: Guo Guang Zhang
Abstract: Simplex method is one of the most useful methods to solve linear program. However, before using the simplex method, it is required to have a base feasible solution of linear program and the linear program is changed to thetypical form. Although there are some methods to gain the base feasible solution of linear program, artificial variablesare added and the times of calculating are increased with these calculations. In this paper, an extended algorithm of the simplex algorithm is established, the definition of feasible solution in the new algorithm is expended, the test number is not the same sign in the process of finding problem solution. Explained the principle of the new algorithm and showed results of LP problems calculated by the new algorithm.
Authors: Mu Zou, Qiao Lun Gu
Abstract: In the closed-loop logistics network, in order to ensure the reusing degree of the collected used-products, its needed to test and evaluate the used-products that are waiting for being collected. This will inevitably appear errors of the status inspection, thus affecting the optimal values of the closed-loop logistics network. In this paper, a closed-loop logistics network planning model with detection errors is established, and the impacts of the detection error rates on the optimal solution of the logistics network have been analyzed.
Authors: Stephen B. Twum
Abstract: This paper considers the application of Linear Programming (LP) to an investment decision problem of a firm in Ghana. The aim is to maximise the investment of the firm. The investment concern of the firm was first modelled as LP problem and then solved. A sensitivity analysis was subsequently performed on the model to assess its stability to slight variations of some selected parameters. This yielded a range of possibilities for the solution of the model and provided a basis for the selection of the best optimal solution.
Authors: Eva Šlaichová, Eva Štichhauerová, Lukáš Turčok
Abstract: The efficient decision-making process is the key criteria for evaluation of the managers and their future career in the enterprises. In the frame of operation research and operation analysis it is possible to use number of methods and techniques. However considering the up-to-date situation in the enterprises, linear programming is one of the most efficient techniques. It can be used by managers to solve problems considering any manufacturing or logistical problems. Application of the linear programming generally enables the managers to maximize the profit and minimize the costs on the other hand. This contribution presents the results of pilot research focused on the use of operations research methods in business. For this purpose we have contacted 10 companies which deal with the issue of operations research methods. The authors of the contribution primarily took into consideration the linear programming, particularly application and results achieved by this method. The analysis of software tools that can be used in the context of linear programming is also included in the contribution. In the next chapter of the contribution selected example of application of linear programming in a company is presented.
Authors: S.V. Razumnikov
Abstract: This paper summarizes cloud computing services presented at the market nowadays, describes their features, and introduces an economic and mathematical modeling algorithm for assessing the output of cloud-based services using the linear optimization method
Showing 1 to 10 of 56 Paper Titles