On the Use of the Simplex Algorithm for the Absolute Deviation Curve Fitting Problem
Article Abstract:
Frequently, linear curve-fitting dilemmas are solved with a criterion that minimizes the total of deviation squares of line observations. The validity of that treatment is linked to various assumptions which are too often untested. However, the curve-fitting function can be justified through computational tractibility. While another method that fits lines by employing a minimized sum criterion has appeal it has been neglected due to its computational complexity. Such a problem can be handled with linear programming. Three linear programming codes are given for the solution. Two are traditional implementations of the simplex method, and the other one is a unique purpose code created specifically for the problem. Batch manufacturing live data was used in the problem formulation. To develop a regression equation, research is channelled toward yield dependence on machine types. Tables of iteration data are featured, as are graphs.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
An algorithm for storage device selection and file assignment
Article Abstract:
Proposed mathematical programs for characterizing a storage plan problem are evaluated. The method uses heuristics based on dynamic programming to derive an initial solution and an algorithm which uses column generation to search for the solution and provide a lower bound. Results show that the solutions generated by the algorithm have a less than one percent average suboptimality.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
A fast algorithm for two-dimensional pallet loading problems of large size
Article Abstract:
Research developing an algorithm aimed at solving the problem of loading an orthogonal pallet with identical rectangles without overlapping is presented. Particular attention is given to computational analyses demonstrating the success of this algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: In the eye of the beholder. US/Turkey sign investment agreement
- Abstracts: Billions of Czech crowns for the liquidation of mines. Trade with the Yugoslavian Federal Republic
- Abstracts: The soul of the matter? A matter of choice: hanging. Only a matter of time
- Abstracts: A bullet for teacher: violence in schools. Violence a la canadienne. The roots of violence
- Abstracts: Breathing the air of success. Consumed with fear. Fear and breathing