home
 Other disciplines
Books
Mathematics programmers - Nakonechny S.I.
|
Mathematics programmers - Nakonechny S.I.
 |
Nakonechny S.I., Savina S.S. Н-22 Mathematics programm : Nav. Посіб. - К .: КНЕУ, 2003. - 452 with. ISBN 966-574-538-7 Навчальний посібник it is written відповідно to programmers to the course "Mathematicians програмування" for preparation of bachelors of economics. In the course of the study, the basic mathematical methods of the model of economical systems and processes are the basis for the acquisition of managerial rulers in realities. Rozdili of the first in terms of priisvyacheny tasks litnogo programvannya, teorii dvuhistosti, ekonomichnogo analizu optimalnykh planiv. Z shostogo on odnadtsyatiy rozdіli rozglyadayutsya zablonnіsі problemy mathematicheskogo programmuvannya: tsіlochislovі, nelinіynі, dynamichny, stochastichny, shobovo-linnіyni, problemi teorii іgor. Theoretical material is to be worked by numerically economical and mathematical models, which adequately imitate the basic vibro-economic processes. In kolkok rozdilyah imposed on the program material. It is recommended to hold bachelor's degree in economics and economics for those students who have not navigated in the past, who can read the "Mathematics program" and "Dozenschenna operatsi" courses, as well as for students in the field of economics and economics. BBK 22.18 |
ZMIST
PEREDMOVA
ROZDIL 1. SUBJECT, SPHERIA TA OBOBILIVOSTY Zastosuvannya MATHEMATICAL PROGRAMMUNNYA IN ECONOMICS. CLASIFICATION OF TASKS
1.1. The subject of that subject is mathematical programming
1.2. Mathematical formulation of problems and mathematical programming
1.3. Приклад економіко-математичної моделі
1.4. Багатокритеріальна оптимізація
1.5. Історична довідка
1.6. Classification of problems of mathematical programming
1.7. Buttons of economical problems of mathematical programming
ROZDIL 2. ZAGALNA THE PROBLEM OF THE LINE PROGRAMMAN OF THOSE DECAYS OF METHODS ЇЇ ROSVILYAZANNA
2.1. Butts of incentives for economical and mathematical models of economical processes
2.2. The economical-mathematical model of problems of linear programming
2.3. Forms of recording tasks of linear programming
2.4. Geometrical Interpretation of Problems of Linear Programming
2.5. The basic authorities of the rozv'yakiv tasks of the linear programming
2.6. The graphical method of outlining tasks of linear programming
2.8. The simplex method of outlining the tasks of linear programming
2.8.1. Povotkovy support plan
2.8.2. Perehid from one basic plan to the next
2.8.3. Optimal rozvyazok. Criterion of optimality for the plan
2.8.4. Rozv'yazavannya problemy lennyi programmannya simplex method
2.8.6. Unit basis method
2.8.7. Zatsiklennya in the tasks of literary programming
2.8.8. Geometric Interpretation of the Simplex Method
2.9. Modifikatsii simplex method
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 3. THEORETICAL DUALITY TWO TWO OCINS IN LINE PROGRAMMING
3.1. Eco-friendly Interpretation of the direct tasks of the linear programming
3.2. Rules for the motivation of binary tasks
3.3. The basic theorems of the duality of economical zmist
3.3.1. The first theorem of the duality
3.3.2. The other theorem of binary
3.3.3. The third theorem of binary
3.4. Butts zastosuvannya teorії dvuhistostі for oderhodzhennya optimal planіv direct ya dvoystoy tasks
3.5. Післяоптимізаційний аналіз задач лінійного програмування
3.5.1. Analis to the range of the component of the vector of the
3.5.2. Analiz dіапазону зміни коефіцієнтів цільової функції
3.5.3. Аналіз діапазону зміни коефіцієнтів матриці омежень
3.6. The simplex method
3.7. Parametrically programmed
3.7.1. Parametric properties of the vector
3.7.2. Parametrical changes in the vector of the functions of the function of functions
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROSDIL 4. ANALYSIS OF LINE MODELS OF ECONOMIC OBJECTIVES
4.1. Приклад економічної інтерпретації Betting of conjugating problems
4.2. Analisz rozv'yakіv conjugation of economical and mathematical problems
4.3. Оцінка рентабельності продукції, яка виробляється, і нової продукції
4.4. Analisis of deprivation and non-negative resources
4.5. Analiz koefіtsієntіv tsіlової функції
4.6. Analisis of facial mattresses
4.7. Applied practical practice of the binary otsinok at analizі ekonomicheskih problemy
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 5. TRANSPORT TASK
5.1. Economical and mathematical formulation of transport problems
5.2. Vlastivostі of the basic plans of transport tasks
5.3. Methods of motivating the basic plan of transport tasks
5.4. Vipadok virodzhennya basic plan of transport tasks
5.5. Methods for the development of transport tasks
5.5.1. Task, binary to transport
5.5.2. The method of potentiating the roving of the transport tasks
5.5.3. Monotony and Skinning to the Method of Potentialities
5.5.4. Butts rozvyazuvannya transport tasks using the method of potentiation
5.5.5. Угорський метод розв'язування транспортної задачиі
5.6. Transport problem with extraordinarial powers
5.7. Dvahhetapna transport task
5.8. Transport problem for the critical hour
5.9. Розв'язування транспортної задачі на мережі
5.9.1. The transport problem in the form of molds
5.9.2. Method of potentiation on the least possible
5.10. Buttons of economical tasks, to be built up to transport models
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 6. TSILOCHISLOVI OBJECTIVES OF THE LINE PROGRAMMAN. BASIC METHODS Ї X ROSVYAZUNANNYA TA ANALYSZ
6.1. Economical and mathematical formulation of the objectives of the linear programming
6.2. Geometrical Interpretation of rozv'yakіv tsilochislichnyh problems lіnіynogo programvannya on ploschiny
6.3. The characteristic of the method in the study of the number of problems of linear programming
6.4. Методи відтинання. Method Гоморі
6.5. Combinatory methods. The method is
6.6. Nablistheni methods. Vector Decay Method
6.7. Butts zashosuvannya tsіlochislichih tasks lіynіynogo programvannya u planuvannі tulyavnnі vibrobnitsvom
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 7. PROBLEMS OF THE FREESTY-LINE PROGRAM. BASIC METHODS Ї X ROSVYAZUNANNYA TA ANALYSZ
7.1. Economical and mathematical formulation of problems of shot-and-mine programming
7.2. Geometrical Interpretation of tasks of shot-and-mine programming
7.3. Розв'язування дробово-лінійноїї problems in buildings up to tasks of linear programming
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 8. OBJECTIVES OF THE NON-PROLIFTED PROGRAM. BASIC METHODS Ї X ROSVYAZUNANNYA TA ANALYSZ
8.1. Economical and mathematical formulation of tasks and non-linear programming
8.2. Geometrical Interpretation of Problems of Nonlinear Programming
8.3. The main difficulties in the development of the tasks of non-linear programming
8.4. Classic method of optimization. The Lagrange multiplication method
8.4.1. Wit and frenzy ekstremumi functions
8.4.2. The Lagrange multiplication method
8.5. The need for the sine point
8.6. Kuhn-Tucker Theorem
8.6.1. Опуклі й угнуті функції
8.7. Spoiled programmed
8.8. Quadratically programmed
8.8.1. The quadratic form of that power
8.8.2. The method of solving the problems of quadratic programming
8.9. Економічна інтерпретація множів Lagrange
8.10. Gradient method
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROSDIL 9. DYNAMICHNE PROGRAMMANNNAYA
9.1. The economical nature of the tasks of dynamical programming
9.2. The task of the rozpodil kapitalovkladen mizh duma pіdpriemstvami n n rockiv
9.2.1. The method of recurrent spivvidnoshen
9.3. The task of the rozpodil kapitalovkladen mіzh pіdprіємствам
9.4. The principle of optimality
9.5. Bagatocrocus process priinyattya rishen
9.6. Butts rozv'yazvanya tasks dynamical programmuvannya
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
10. STOKHASTICHNE PROGRAMMANNNAYA
10.1. The mathematical formulation of tasks and stochastic programming
10.2. Specificities of the mathematical formulation of the problems of stochastic programming
10.3. Buttons of economical tasks of stochastic program
10.4. One-purpose tasks of stochastic programming
10.5. Dvoyhetapny tasks of stochastic program
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROSDIL 11. THEOREY IGOR
11.1. Основныені поняття теорії ігор
11.2. Класифікація ігор
11.3. Матричні ігри двох осіб
11.4. Graz by zymishanimi strategists
11.5. Geometrical Grid Interpretation 2 x 2
11.6. Zvodnya matrix gri before tasks of linear programming
Заключні зауваження
Supervised livelihoods
RECOMMENDED LITERATURE
ROZDIL 1. SUBJECT, SPHERIA TA OBOBILIVOSTY Zastosuvannya MATHEMATICAL PROGRAMMUNNYA IN ECONOMICS. CLASIFICATION OF TASKS
1.1. The subject of that subject is mathematical programming
1.2. Mathematical formulation of problems and mathematical programming
1.3. Приклад економіко-математичної моделі
1.4. Багатокритеріальна оптимізація
1.5. Історична довідка
1.6. Classification of problems of mathematical programming
1.7. Buttons of economical problems of mathematical programming
ROZDIL 2. ZAGALNA THE PROBLEM OF THE LINE PROGRAMMAN OF THOSE DECAYS OF METHODS ЇЇ ROSVILYAZANNA
2.1. Butts of incentives for economical and mathematical models of economical processes
2.2. The economical-mathematical model of problems of linear programming
2.3. Forms of recording tasks of linear programming
2.4. Geometrical Interpretation of Problems of Linear Programming
2.5. The basic authorities of the rozv'yakiv tasks of the linear programming
2.6. The graphical method of outlining tasks of linear programming
2.8. The simplex method of outlining the tasks of linear programming
2.8.1. Povotkovy support plan
2.8.2. Perehid from one basic plan to the next
2.8.3. Optimal rozvyazok. Criterion of optimality for the plan
2.8.4. Rozv'yazavannya problemy lennyi programmannya simplex method
2.8.6. Unit basis method
2.8.7. Zatsiklennya in the tasks of literary programming
2.8.8. Geometric Interpretation of the Simplex Method
2.9. Modifikatsii simplex method
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 3. THEORETICAL DUALITY TWO TWO OCINS IN LINE PROGRAMMING
3.1. Eco-friendly Interpretation of the direct tasks of the linear programming
3.2. Rules for the motivation of binary tasks
3.3. The basic theorems of the duality of economical zmist
3.3.1. The first theorem of the duality
3.3.2. The other theorem of binary
3.3.3. The third theorem of binary
3.4. Butts zastosuvannya teorії dvuhistostі for oderhodzhennya optimal planіv direct ya dvoystoy tasks
3.5. Післяоптимізаційний аналіз задач лінійного програмування
3.5.1. Analis to the range of the component of the vector of the
3.5.2. Analiz dіапазону зміни коефіцієнтів цільової функції
3.5.3. Аналіз діапазону зміни коефіцієнтів матриці омежень
3.6. The simplex method
3.7. Parametrically programmed
3.7.1. Parametric properties of the vector
3.7.2. Parametrical changes in the vector of the functions of the function of functions
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROSDIL 4. ANALYSIS OF LINE MODELS OF ECONOMIC OBJECTIVES
4.1. Приклад економічної інтерпретації Betting of conjugating problems
4.2. Analisz rozv'yakіv conjugation of economical and mathematical problems
4.3. Оцінка рентабельності продукції, яка виробляється, і нової продукції
4.4. Analisis of deprivation and non-negative resources
4.5. Analiz koefіtsієntіv tsіlової функції
4.6. Analisis of facial mattresses
4.7. Applied practical practice of the binary otsinok at analizі ekonomicheskih problemy
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 5. TRANSPORT TASK
5.1. Economical and mathematical formulation of transport problems
5.2. Vlastivostі of the basic plans of transport tasks
5.3. Methods of motivating the basic plan of transport tasks
5.4. Vipadok virodzhennya basic plan of transport tasks
5.5. Methods for the development of transport tasks
5.5.1. Task, binary to transport
5.5.2. The method of potentiating the roving of the transport tasks
5.5.3. Monotony and Skinning to the Method of Potentialities
5.5.4. Butts rozvyazuvannya transport tasks using the method of potentiation
5.5.5. Угорський метод розв'язування транспортної задачиі
5.6. Transport problem with extraordinarial powers
5.7. Dvahhetapna transport task
5.8. Transport problem for the critical hour
5.9. Розв'язування транспортної задачі на мережі
5.9.1. The transport problem in the form of molds
5.9.2. Method of potentiation on the least possible
5.10. Buttons of economical tasks, to be built up to transport models
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 6. TSILOCHISLOVI OBJECTIVES OF THE LINE PROGRAMMAN. BASIC METHODS Ї X ROSVYAZUNANNYA TA ANALYSZ
6.1. Economical and mathematical formulation of the objectives of the linear programming
6.2. Geometrical Interpretation of rozv'yakіv tsilochislichnyh problems lіnіynogo programvannya on ploschiny
6.3. The characteristic of the method in the study of the number of problems of linear programming
6.4. Методи відтинання. Method Гоморі
6.5. Combinatory methods. The method is
6.6. Nablistheni methods. Vector Decay Method
6.7. Butts zashosuvannya tsіlochislichih tasks lіynіynogo programvannya u planuvannі tulyavnnі vibrobnitsvom
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 7. PROBLEMS OF THE FREESTY-LINE PROGRAM. BASIC METHODS Ї X ROSVYAZUNANNYA TA ANALYSZ
7.1. Economical and mathematical formulation of problems of shot-and-mine programming
7.2. Geometrical Interpretation of tasks of shot-and-mine programming
7.3. Розв'язування дробово-лінійноїї problems in buildings up to tasks of linear programming
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROZDIL 8. OBJECTIVES OF THE NON-PROLIFTED PROGRAM. BASIC METHODS Ї X ROSVYAZUNANNYA TA ANALYSZ
8.1. Economical and mathematical formulation of tasks and non-linear programming
8.2. Geometrical Interpretation of Problems of Nonlinear Programming
8.3. The main difficulties in the development of the tasks of non-linear programming
8.4. Classic method of optimization. The Lagrange multiplication method
8.4.1. Wit and frenzy ekstremumi functions
8.4.2. The Lagrange multiplication method
8.5. The need for the sine point
8.6. Kuhn-Tucker Theorem
8.6.1. Опуклі й угнуті функції
8.7. Spoiled programmed
8.8. Quadratically programmed
8.8.1. The quadratic form of that power
8.8.2. The method of solving the problems of quadratic programming
8.9. Економічна інтерпретація множів Lagrange
8.10. Gradient method
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROSDIL 9. DYNAMICHNE PROGRAMMANNNAYA
9.1. The economical nature of the tasks of dynamical programming
9.2. The task of the rozpodil kapitalovkladen mizh duma pіdpriemstvami n n rockiv
9.2.1. The method of recurrent spivvidnoshen
9.3. The task of the rozpodil kapitalovkladen mіzh pіdprіємствам
9.4. The principle of optimality
9.5. Bagatocrocus process priinyattya rishen
9.6. Butts rozv'yazvanya tasks dynamical programmuvannya
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
10. STOKHASTICHNE PROGRAMMANNNAYA
10.1. The mathematical formulation of tasks and stochastic programming
10.2. Specificities of the mathematical formulation of the problems of stochastic programming
10.3. Buttons of economical tasks of stochastic program
10.4. One-purpose tasks of stochastic programming
10.5. Dvoyhetapny tasks of stochastic program
Заключні зауваження
Supervised livelihoods
Butts that zavdannya for self-robotics
ROSDIL 11. THEOREY IGOR
11.1. Основныені поняття теорії ігор
11.2. Класифікація ігор
11.3. Матричні ігри двох осіб
11.4. Graz by zymishanimi strategists
11.5. Geometrical Grid Interpretation 2 x 2
11.6. Zvodnya matrix gri before tasks of linear programming
Заключні зауваження
Supervised livelihoods
RECOMMENDED LITERATURE
Comments
When commenting on, remember that the content and tone of your message can hurt the feelings of real people, show respect and tolerance to your interlocutors even if you do not share their opinion, your behavior in the conditions of freedom of expression and anonymity provided by the Internet, changes Not only virtual, but also the real world. All comments are hidden from the index, spam is controlled.