|
|
Home ยป
Teaching
|
SEMESTER 1
|
|
SM21202 Mathematical Programming
|
Synopsis :
This course will provides some mathematical techniques which are used as the tools for solving maximization or minimization problems. Some
important concepts such as linear programming, integer programming, non-linear programming, goal programming, game theory and network models will be covered. Students are also
able to understand and solve the mathematical programming problems by using LINGO and LINDO.
|
|
SM31102 Computational Geometry
|
Synopsis :
This course will provides some geometry algorithms which consider algorithm and data structure to solve problems using computer in form of
discrete geometry (points, lines and polygon) especially in two and three spaces. The topics include convex hull, intersection, triangulation, voronoi diagram, delauny
triangulation and motion planning.
|
|
SEMESTER 2
|
|
SM21003 Operations Research
|
Synopsis:
Linear Programming Formulation: Introduction to various problem solving techniques such as graph, simplex algorithm, revised simplex algorithm,
primal dual, sensitivity analysis. Problem solving with integer decision variables: Gomory cutting plane. Introduction to various problems solving in transportation model,
competition model and computer output interpretation: LINGO package.
|
updated on 2009-08-12 01:12:41 by Asdalifah Talibe
|
