040491 KU Implementation of Optimization Techniques (MA) (2017S)
Continuous assessment of course work
Labels
The KU Implementation of Optimization Techniques is offered as a Nicht-BWL-Modul for the KFKs Production Management, Supply Chain Management, and Transportation Logistics in the old Master Curriculum Business Administration. In the new Master Curriculum (WS16) the course is obligatory of the Major Smart Production and Supply Chain Management.The course is recomended for students who intend to write their master thesis at the chair of Production and Operations Management (POM) or the chair of Production and Operations Management with International Focus (PLIS).Student of Business Informatics are advised to attend other Nicht-BWL-Moduls of the above mentioned KFKs.
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from We 15.02.2017 09:00 to We 22.02.2017 12:00
- Deregistration possible until Tu 14.03.2017 23:59
Details
max. 20 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Thursday 02.03. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 09.03. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 16.03. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 23.03. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 30.03. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 06.04. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 27.04. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 04.05. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 11.05. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 18.05. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 01.06. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 08.06. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 22.06. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Thursday 29.06. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
Information
Aims, contents and method of the course
Assessment and permitted materials
* [35%] Homework: Programming Exercises (28%) & Theory questions (7%)
* [30%] Mid-Term Exam
* [35%] End-Term ExamThe homework programming exercises can (and should be done) in groups of 2 - 3 people. They have to be uploaded in Moodle until latest Tuesday 23:59 o'clock prior to the next class. At the beginning of each class groups will be randomly selected to present their code (resp. solution method).
The amount of work for the homework exercises increases throughout the semester, therefore the amount of points which can be gained is weighted according to their workload (i.e. exercises at the beginning of the semester are worth less points than exercises at the end of the semester).
Attempts of cheating by groups (e.g. uploading code which was not written by themselves) of single students (e.g. no contribution to the exercise) can be penalized by deducting up to twice as many points as the exercise is worth.Theory questions have to be ticked on Moodle until Thursday 12:00 o'clock. At the beginning of each class students will be selected randomly to present the answers to the theory questions. Again, attempts of cheating can be penalized by deducting up to twice as many points as the question is worth.In general, if a theory question is ticked or a programming exercise is uploaded students must be present in class, so that they can be chosen to present their homework. Failure to do so (without prior notification of absence) will be considered as an attempt of cheating.If one is asked to present the solution of a programming exercise but fails to do so, all points for programming exercises of the respective class will be canceled. Similarly, if one fails to answer a theory question, all ticks for theory questions of the respective class will be canceled.
* [30%] Mid-Term Exam
* [35%] End-Term ExamThe homework programming exercises can (and should be done) in groups of 2 - 3 people. They have to be uploaded in Moodle until latest Tuesday 23:59 o'clock prior to the next class. At the beginning of each class groups will be randomly selected to present their code (resp. solution method).
The amount of work for the homework exercises increases throughout the semester, therefore the amount of points which can be gained is weighted according to their workload (i.e. exercises at the beginning of the semester are worth less points than exercises at the end of the semester).
Attempts of cheating by groups (e.g. uploading code which was not written by themselves) of single students (e.g. no contribution to the exercise) can be penalized by deducting up to twice as many points as the exercise is worth.Theory questions have to be ticked on Moodle until Thursday 12:00 o'clock. At the beginning of each class students will be selected randomly to present the answers to the theory questions. Again, attempts of cheating can be penalized by deducting up to twice as many points as the question is worth.In general, if a theory question is ticked or a programming exercise is uploaded students must be present in class, so that they can be chosen to present their homework. Failure to do so (without prior notification of absence) will be considered as an attempt of cheating.If one is asked to present the solution of a programming exercise but fails to do so, all points for programming exercises of the respective class will be canceled. Similarly, if one fails to answer a theory question, all ticks for theory questions of the respective class will be canceled.
Minimum requirements and assessment criteria
At least 50% have to be obtained for a positive grade. The other grades are distributed as follows:
4: 50% to <63%
3: 63% to <75%
2: 75% to <87%
1: 87% to 100%
4: 50% to <63%
3: 63% to <75%
2: 75% to <87%
1: 87% to 100%
Examination topics
* Basic concepts of the C++ programming language (data types and operators, selective structures, iteration structures, input and output with files, arrays, functions, structures, pointers, standard template library, recursive functions, etc.).
* Implementation of optimization methods for various problems that arise in production and logistics.
* Implementation of optimization methods for various problems that arise in production and logistics.
Reading list
All teaching material (slides, exercises, sample solutions, etc.) are available on the elearning platform Moodle.
In order to access this material you need a valid UNET account. Moodle weblogin: https://moodle.univie.ac.at/Useful links:
http://www.cplusplus.com/doc/tutorial/
http://www.cppreference.com
http://www.uow.edu.au/~nabg/ABC/ABC.html
In order to access this material you need a valid UNET account. Moodle weblogin: https://moodle.univie.ac.at/Useful links:
http://www.cplusplus.com/doc/tutorial/
http://www.cppreference.com
http://www.uow.edu.au/~nabg/ABC/ABC.html
Association in the course directory
Last modified: Mo 07.09.2020 15:29
* Get familiar with Microsoft Visual Studio Community 2015 for Windows Desktop (including debugging and preprocessor directives)
* Basic concepts of the C++ programming language (data types and operators, selective structures, iteration structures, input and output with files, arrays, functions, structures, pointers, standard template library, recursive functions).
* Methodological knowledge for developing algorithms and their translation into C++ (a step by step approach to select suitable data and program structures)
* Implementation of Constructive Methods and Improvement Methods for the Traveling Salesperson Problem (TSP) and the Vehicle Routing Problem (VRP)