У роботі коротко говориться, що таке математичне, зокрема лінійне, програмування. Незважаючи на простоту теорія, лінійне програмування має широке практичне застосування. У роботі наводиться невеликий перелік важливих задач, моделі яких є лінійними так вказується які саме використовувалися при побудові інтерактивного електронного атласу Києва.
Nowadays, mathematical programming continues to be one of the chapters of applied mathematics that develop most rapidly. For this there are many reasons. Perhapschief among them is the diversity of species as its application in engineering and other areas of applied mathematics. You can specify some of them:in operations research, optimization of technical and economic systems (planning, econometrics), transport problems, inventory management, etc.;
in numerical analysis, approximation, regression, solution of linear and nonlinear systems, numerical methods related to the inclusion of finite element methods, etc., in automation, detection systems, optimal control systems, filtering, production management and so on;
in technology, management and optimization of the size of structures, optimal planning of complex technical systems such as information systems, computer networks, transport and telecommunica&tions networks, etc.;
in mathematical economics: solving large macroeconomic models (such as input-output model), microeconomic models or models of entrepreneurship, decision theory and game theory.
As we see mathematics, including linear programmi&ng has wide application in various fields of applied science. So naturally, some problems arise when building an interactive electronic atlas Kyiv were consolidated to known linear programming problems. In particular task of finding favorite places w&as reduced to the traveling salesman problem.
Also the development of the atlas there were tasks associated with finding the minimum spanning tree. Recall the definition of minimal spanning tree. Suppose we have a graph: the set of vertexes and edge&s with weights that connects them. Spanning tree is called a subset of edges of the graph, you can go from any vertex to an arbitrary vertex, using the edge of this set. At a minimum spanning tree called the tree with minimum weight - the sum of the &weights (length) of edges. To solve this problem we were using standard methods, such as Kruskal and Prim.
В работе кратко рассказывается о математическом, в частности линейном, программировании. Несмотря на простоту теории, линейное программировани&е имеет широкое практическое применение. В работе рассматриваются некоторые важные задачи с линейными моделями и говорится какие именно использовались при построении интерактивного электронного атласа города Киева.