ΠΕΡΙΓΡΑΜΜΑ ΜΑΘΗΜΑΤΟΣ

The course deals with concepts and methodologies of Mathematical Programming and Multicriteria Decision Making. Emphasis is placed on modeling management problems using integer variables (integer programming). The introduction of the latter allows the modeling of a wide range of problems that the techniques covered in the aforementioned compulsory courses are unable to model. In addition to problems that are by their nature integral, the use of binary variables (binary variables) for the introduction of logical conditions in each mathematical program is analyzed. Special forms of combinatorial optimization problems are also discussed, such as Knapsck Problem, Traveling Salesman Problem, Set Covering Problem, etc. Brief reference is also made to the procedures for solving general integer programming problems (Branch and Bound Algorithm, Gomory Cutting Plane Algorithm). In addition, the primary objective of the course is to acquaint the students with the methodologies of multi-criteria decision analysis for making administrative decisions. Decision problems, such as those of classification, ranking, and optimal selection among a set of alternative actions, are common in the modern business environment, and the decision maker almost always has to consider multiple, conflicting, and disparate criteria. The problems, whether they concern the strategic, tactical or day-to-day business level of decision-making are complex and the ideal solution in most cases is impossible.

During the course, the effort will be for the students to understand the basic concepts of multi-criteria decision theory, and more specifically the following:

• Goal Planning (burdened, lexicographic).
• Analytic Hierarchy Process (AHP).
• Technique of Order Preference Similarity to the Ideal Solution (TOPSIS).
• Upon completion of the course, students are expected to have developed the ability to solve realistic optimization problems in real time.

to be filled

Integer Combinatorial Optimization Knapsck Problem, Traveling Salesman Problem, Set Covering Problem, Branch and Bound Algorithm, Gomory Cutting Plane Algorithm, Classification, Ranking and Optimal Selection Problems, Goal Programming, Analytic Hierarchy Process (АHP), Technique of Order Preference Similarity to the Ideal Solution (TOPSIS).

Συγγράμματα

ΔΙΔΑΚΤΙΚΑ ΣΥΓΓΡΑΜΜΑΤΑ

1. Εισαγωγή στην Επιχειρησιακή Έρευνα Hamdy A. Taha.
2. Συνδυαστική Βελτιστοποίηση, Ιωάννης Μαρινακης, Αθανάσιος Μυγδαλας.

ΠΡΟΣΘΕΤΗ ΠΡΟΤΕΙΝΟΜΕΝΗ ΒΙΟΒΛΙΟΓΡΑΦΙΑ

1. ΔΙΑΚΡΙΤΗ ΒΕΛΤΙΣΤΟΠΟΙΗΣΗ, ΜΗΛΙΩΤΗΣ ΠΑΝΑΓΙΩΤΗΣ, ΜΟΥΡΤΟΣ ΙΩΑΝΝΗΣ.