Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Optimization: algorithms and consistent approximations
Optimization: algorithms and consistent approximations
Optimization by Vector Space Methods
Optimization by Vector Space Methods
An approach for solving nonlinear programming problems
The Korean Journal of Computational & Applied Mathematics
| Hi-index | 0.00 |
In this paper we study the problem of three-dimensional layout optimization on the simplified rotating vessel of satellite. The layout optimization model with behavioral constraints is established and some effective and convenient conditions of performance optimization are presented. Moreover, we prove that the performance objective function is locally Lipschitz continuous and the results on the relations between the local optimal solution and the global optimal solution are derived.