Abstract

Mathematical Programming deals with optimization programs of the form and includes the following general areas: minimize f(x) subject to gi(x) ≤ 0, i = 1,..., m, [x ⊂ R n] 1. Modelling: methodologies for posing various applied problems as optimization programs; 2. Optimization Theory, focusing on existence, uniqueness and on characterization of optimal solutions to optimization programs; 3. Optimization Methods: development and analysis of computational algorithms for various classes of optimization programs; 4. Implementation, testing and application of modelling methodologies and computational algorithms. Essentially, Mathematical Programming was born in 1948, when George Dantzig has invented Linear Programming – the class of optimization programs (P) with linear objective f(·) and

Citations

91	Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and - Nesterov - 1998
71	Squared functional systems and optimization problems - Nesterov - 2000
51	Theory and algorithms for linear optimization. An interior point approach. Series in discrete mathematics and optimization - Roos, Terlaky, et al. - 1997
29	Global quadratic optimization via conic relaxation - Nesterov - 1998
5	Interior point polynomial time methods in convex programming, Lecture - Nemirovski