Course Title : Systems Analysis and Exercises for Planning and Management

Code 35070
Course Year 2nd year
Term 2nd term
Class day & Period Monday・1-2
Location Kyoutsuu4
Credits 2
Lecture Form(s)
Language English
Instructor Schmöcker

Course Description

Attendants of this course should already have a basic knowledge about planning of civil engineering projects. In this course students will learn about this subject in a more systematic way. Students will be introduced to policy-making, management and planning and in particular to useful mathematical tools for doing so. They will gain a deeper understanding of linear, nonlinear and dynamic programming. This is achieved through lectures, and practical exercises with these methods.


Assignments, Midterm Exam 40%; Final Exam 60%

Course Goals

This course aims to provide students with the basic knowledge required for planning of civil engineering projects and to provide an understanding of basic planning theory and its role. The focus is on mathematical planning methods for system design. By attending this lecture students should obtain the basic knowledge and thinking of planners. Further, students should understand the importance of the above mentioned three programming methods as useful mathematical tools for creating plans. Finally students should obtain practical skills through exercises.

Course Topics

Theme Class number of times Description
Basic Theory of Civil Engineering Planning (CEP) 3 These lectures provide a basic overview of CEP and teach about the science underpinning CEP. Therefore lectures introduce the students to the role of OR, economics, psychology, sociology and political science in CEP.
Linear programming (LP) 10 Lectures about LP as basic method for mathmatecial planning. Various issues of LP are discussed and in particular the Gauss Jordan Elimination Method and the Simplex methods are taught. Further the dual problem, marginal value and sensitivity analysis are introduced.
Non linear programming (NLP) 10 NLP formulation of problems, global optimality, and description as programming problem. Optimality conditions of nonlinear programming problems (Lagrange function, Kuhn Tucker conditions) are examined.
Dynamic programming (DP) 7 These lectures will introduce DP as a useful tool to solve complex systems. Formulation and solution of DP problems are discussed. Further, PERT as DP network method is introduced, describing process management based on arrow diagrams.


Handouts distributed during lectures


Hillier,F.S. Lieberman,G.J.: Introduction to Operations Research
Iida, Y.: Civil Engineering Planning System Analysis (Optimization Guide)
Iida, Y./ Okada, N.: Civil Engineering Planning System Analysis (Behaviour Analysis)
Fujii, S.: Infrastructure planning studies


Students are assumed to have taken the calculus courses.

Web Sites

Presented during the first lecture.

Additional Information