A solution proposal to the interval fractional transportation problem

It is termed "Operational Research" by the British and Europeans and "Operations Research" by the Americans. Operations Research is generally considered a "Problem Solving" and "Decision Science". Linear Programming, one of the techniques that finds the most common use in Operatian Research, is the whole concept and techniques related to linear decision models. Linear programming is a deterministic technique that assumes that all model parameters are known precisely. A special type of linear programming is the transportation model. Transport models can be used in areas such as stock control, labor force planning, site selection, and distribution of jobs to machines. In this study, the objective is to ensure that goods transported from the production centers in an interval facility to interval demanding consumption centers are sent optimally to the total transportation cost of an enterprise. Spare parts produced in the automotive company are required to be distributed from 4 separate factories to 3 separate warehouses. The manufactured of inventory in the warehouse and the product capacities in the factories are determined at certain interval. In addition, unit transportation costs, which are stored from factories to warehouse , are determined as interval and fractional. According to this, fractional objective functions and constraints are determined and a transportation model is established. The objective function for the solution is extended to the Taylor polynomial at points determined according to the initial values. The values and constraints found are entered into the WINQSB package program and the program calculates the iteration result. With this result, the objective function is extended to the Taylor polynomial once again. The values and constraints for the objective function are entered into WINQSB package program once again and an iteration is made. The results of the WINQSB packet program continue to iterate until two iterations repeat successive the value in kind. In our study, the solution was reached at 4. iteration. It has been determined that equations are provided when the results are substituted in the constraint functions. In each iteration, it is determined that theoptimum solution is more approximated in the objective function.