Resources that are used in forest fire fights may vary. They imply different types of machinery, chemical means of fire fighting, explosives, and some others. We may distinguish two types of maneuvering: maneuvering, induced before the start of fire season, for example, aircraft transfer to their base location; maneuvering, induced in real time during the fire season. The forest fire resources decision-maker should have optimal plan of transfer of resources from the places of their availability to the places, where they are needed. What is more, this transfer should be fulfilled according to some criterion, for example, transfer expenses. We should remark that the means of transferring resources from the places of their availability to the places, where they are needed vary a lot. This might be airplanes, helicopters, cars, etc. The difficulty of solving the problem of optimal maneuvering also depends on variety of packages, used for resources transfer. For example, chemical substances may be delivered in bags that weigh 25, 50 and 100 kilograms. One of the ways of solving the problem of optimal maneuvering of forest fire resources is mixed integer linear programming that implies some modification of simplex-method of linear programming. In order to solve this program a complex of programs was developed. It provides the user with convenient form of getting information about the availability and needs of resources. Current information, organized in different data bases. Information about the means of transfer and transfer expenses is used to determine the optimal plan for solving the transport problem. The complex is made with the help of Delphi 6.0.