This paper presents an application of stochastic (posynomial) geometric programming to an optimal engineering design problem. A theory developed by Avriel and Wilde for calculating and bounding the ...

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

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

The objective of the 3D-SCALO problem is to assign the given components to optimal mounting surfaces and position them at the best locations, while satisfying the requirements for (1) heat dissipation ...

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 ...

In order to utilize quantum chemical calculations for chemistry and related fields, it is essential to develop geometry optimization methods for finding the most stable structure of molecules. The ...

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 ...