

mathematical programming 

Mathematical programming problems are the mathematical problems which ask for minimal or maximal values of an objective function subject to some constraints. This cource provides a theory to solve these problems. 
To find algorithms for solving optimization problems in networks 

A network is defined as a graph with functions where the graph is a pair of a set of vertices and a set of arcs. Optmization problems are the mathematical problems which ask for minimal or maximal values of an objective function subject to some constraints. 
Our lab has been doing activity to find algorithms for solving optimization problems in networks. A network is defined as a graph with functions where the graph consists of a set of vertices and a set of arcs. Optmization problems are the mathematical problems which ask for minimal or maximal values of an objective function subject to some constraints. Current themes are to find an optimal generalized network flow efficiently and/or to develop new methods for solving loglinear optimization problems. 