Akademik Dersler - İçerik

Can built and disuss solution methods of Integer Linear Programming.
Solve integer programming model with branch-and-bound technique.
Solve integer programming model with Gomory cutting plane technique.
Explain the use of integer programming problems.
Can built and disuss solution methods of Assignment problems.
Can built and disuss solution methods of Network problems.
Can built linear programming models for the shortest path, maximum flow, minimum spanning tree, critical path, and minimum cost flow and transshipment problems.
The shortest path, maximum flow, minimum spanning tree problems are solved using their own solution algorithms.
Project operations plans, builds and presents in tabular form.
Determines the functioning of the project activities with CPM (critical path method) technique.
Provides control of project activities with PERT (Program Evaluation and Review) technique.
Can be modeled and be able to use some of the methods of solution of Non-linear optimization problems.
Analyzes the general nonlinear programming problems.
Builds nonlinear programming model.
Some solution methods for non-linear optimization model uses.
Examines methods of decision making under uncertainty.
Selects the best strategy according to decision criterias under risk.
Selects the best strategy according to decision criterias under uncertainty.
Find the best option, using the decision tree.
Select the best strategy using game theory.
Defines, builds and develop solutions to the model of Queuing system.