|
Vestnik SamGU. Estestvenno-Nauchnaya Ser., 2014, Issue 10(121), Pages 48–54
(Mi vsgu448)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematics
On the submodularity of the profit function in a problem of transport planning
V. M. Montlevich Samara State University, Samara, 443011, Russian Federation
(published under the terms of the Creative Commons Attribution 4.0 International License)
Abstract:
In this paper the possibility of using the method of successive calculations to solve the transportation problem on the maximum profit is investigated. The feature of this problem is that a set of consumers isn't defined and gets out from wider set of possible consumers by the criterion of a maximum of profit. Profit is calculated on the basis of consumer demand and prices, which are determined by the contract between the consumer and the company carrying out transportation. It is shown that this problem is reduced to maximization of the profit function defined on the set of all subsets of consumers. The submodularity of profit function is proved, that justified application of method of successive calculations to solve this problem.
Keywords:
discrete optimization, partially ordered set, lattice, submodularity, supermodularity, method of consecutive calculations, plant location problem, transportation problem.
Received: 23.09.2014
Citation:
V. M. Montlevich, “On the submodularity of the profit function in a problem of transport planning”, Vestnik Samarskogo Gosudarstvennogo Universiteta. Estestvenno-Nauchnaya Seriya, 2014, no. 10(121), 48–54
Linking options:
https://www.mathnet.ru/eng/vsgu448 https://www.mathnet.ru/eng/vsgu/y2014/i10/p48
|
|