• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS BIL 2016 MATHEMATICAL PROGRAMMING COMPULSORY 2 2 0 7

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR AYŞE ÖVGÜ KINAY

Offered to

Computer Science

Course Objective

The objective of the course is to provide information about the establishment of linear and non-linear programming models, mathematical basis and solution algorithms of these models.

Learning Outcomes of the Course Unit

1   Be able to model various decision making problems. 2   Be able to solve the linear programming problem. 3   Be able to solve the nonlinear programming problem. 4   Be able to understand the importance of sensitivity analysis. 5   Be able to analyze and interpret the results.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to mathematical programming 2 Fundamentals of linear programming and solution approaches 3 Fundamentals of linear programming and solution approaches (cont.) 4 Simplex Algorithm 5 Simplex Algorithm (cont.) 6 Big M Method 7 Two Phase Simplex Algorithm 8 Review of topics 9 Duality in Linear Programming 10 Duality in Linear Programming (cont.) 11 Nonlinear Programming 12 Convex Sets and Convex Functions 13 Golden Section Search Algorithm 14 Steepest Descent Algorithm

Recomended or Required Reading

Textbook(s): Taha, T.H., Yöneylem Araştırması (6. Basımdan Çeviri), Literatür Yayıncılık, Istanbul, 2018. Supplementary Book(s): Wayne L. Winston, Yöneylem Araştırması Uygulamalar ve Algoritmalar, Palme Yayınevi - Akademik Kitaplar, 2021.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

ovgu.tekin@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 2 28 Tutorials 14 2 28 Preparations before/after weekly lectures 14 4 56 Preparation for midterm exam 1 20 20 Preparation for final exam 1 30 30 Final 1 2 2 Midterm 1 1 1 TOTAL WORKLOAD (hours) 165

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 PO.13 LO.1 4 4 5 LO.2 4 4 5 LO.3 4 4 5 LO.4 4 4 5 LO.5 4 4 5