Studies linear and nonlinear programming, the simplex method, duality, sensitivity, transportation and network flow problems, some constrained and unconstrained optimization theory, and the ...
DUBLIN--(BUSINESS WIRE)--Research and Markets(http://www.researchandmarkets.com/research/799091/deterministic_oper) has announced the addition of John Wiley and Sons ...
Abstract. We consider sensitivity functionals and Lagrange multiplier method for solving finite dimensional convex optimization problem.An analysis based on this property is also applied for ...
The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization. This course will provide a rigorous introduction to the rich ...
This is a preview. Log in through your library . Abstract A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results