Two geopolitical actors implement a geopolitical project that involves transportaion and storage of some commodities. They interact with each other through a transport network. The network consists of several interconnected vertices. Some of the vetrices are trading hubs, storage spaces, production hubs and goods buyers. Actors wish to satify the demand of buyers and recieve the highest possible profit subject to compromise solution principle. A numerical example is given.

This article discusses the algorithms for finding the optimal solution of problems related to the location of temporary storage of goods, warehouses, firms for processing raw materials and shops selling the final product in the transport network. An algorithm is also proposed for finding a compromise solution to the problem of maximizing profits for each agent.