Course 12: The Method of Solving Integer Program: Branch and Bound Method Author: OptimizationCity Group  Introduction The main difference between an integer program and a linear program is the assumption that the variables of the problem are integer. At first glance, this assumption helps to achieve the optimal solution by controlling the all solution and […]

## Nonlinear Programming Course Note 15

Course 15 : Nonlinear Programming Author: OptimizationCity Group Introduction Optimization is actually maximizing or minimizing the value of one or more objective functions with (explicit and implicit) constraints or without constraints. It is also called optimization to find the best solution for problems or to achieve the best result under existing conditions and assumptions. Basically, […]

## Game Theory Course Note 14

Course 14 : Game Theory Author: OptimizationCity Group Introduction The game is a description of economic, social and political activities of people. Each of these activities or games has a structure and rules according to which the players play the game to achieve their goals. These rules and structure tell us what actions each player […]

## Cutting Plane Method Course Note 13

Course 13: The Method of Solving Integer Program: Cutting Plane Method Author: OptimizationCity Group  Introduction The main difference between an integer program and a linear program is the assumption that the variables of the problem are integer. At first glance, this assumption helps to achieve the optimal solution by controlling the all solution and report […]

## Branch and Bound Method Course Note 12

Course 12: The Method of Solving Integer Program: Branch and Bound Method Author: OptimizationCity Group  Introduction The main difference between an integer program and a linear program is the assumption that the variables of the problem are integer. At first glance, this assumption helps to achieve the optimal solution by controlling the all solution and […]

## Integer Programming Modeling Course Note 11

Course 11: Integer Programming Modeling Author: OptimizationCity Group Introduction In linear programming, the assumption of divisibility causes continuous values ​​to be given to integer variables, which are conceptually meaningless. For example, the number of people or the number of devices must be assigned to integer values. In the literature, this type of modeling are called […]

## Stochastic Dynamic Programming Course Note 10

Course 10: Stochastic dynamic programming Author: OptimizationCity Group Introduction The only difference between stochastic dynamic programming and deterministic dynamic programming is that in stochastic dynamic programming, with the determination of the state and decision policy of each step, the state of the next step is not determined, but only its distribution function can be determined. […]

## Deterministic Dynamic Programming Course Note 9

Course 9: Deterministic dynamic programming Author: OptimizationCity Group Introduction Dynamic programming is a type of mathematical technique that is able to divide large and complex problems into smaller and simpler problems and by solving each of them, obtain the optimal solution to the main problem. This method, in fact, is used for a series of […]

## Minimum Cost Flow Problem Course Note 8

Course 8 : Minimum cost flow problem Author: OptimizationCity Group Introduction So far, we have studied the problem of linear programming in general. In this section, we will examine specific types of linear programming problems. In this section, we first examined the general model of minimum cost flow, and then we will examine the specific […]

## Minimum Spanning Tree Problem Course Note 7

Course 7 : Minimum spanning tree problem Author: OptimizationCity Group Introduction So far, we have studied the problem of linear programming in general. In this section, we will examine specific types of linear programming problems. In this section, we first examined the general model of minimum cost flow, and then we will examine the specific […]