ABOUT MULTI-CRITERIA TRANSPORT PROBLEM
This article discusses a special problem of linear programming – transport problem, which consists in searching the most economical plan for transportation of homogenous, interchangeable products from points of production to points of consumption. The mathematical formulation of transport problem in the form of closed and open models is given, as well as the method of bringing an open model to a closed one with the introduction of a fictitious point of production or a fictitious point of consumption of products. A mathematical formulation of a multi-criteria transport problem with two objective functions (simultaneous minimization of total transportation costs and maximization of the importance of transportation) is proposed. There is noted a method that can be used as the most effective for solving such problems. It is a multi-criteria simplex method based on the construction of the Pareto set in the multi-criterion linear programming problem.