Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

The center will unite mathematicians, engineers and computer scientists at Brown, NYU and Georgia Tech to tackle longstanding ...

In this paper, we give an applications-oriented survey of geometric programming. This important class of nonlinear programming problems has been intensively studied over the past decade and has played ...

Geometric programming (GP) is a new technique that appears to have significant potential in marketing. Researchers have avoided optimization models in marketing, partially because empirical estimates ...

Integer programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many practical ...