Bo Zhang, Suxia Ma, Kai Cao. A global optimization approach utilizing convex relaxation for linear multiplicative programming problems. // Journal of Applied Mathematics and Computing. – 2026. – DOI: 10.1007/s12190-025-02715-6. – URL: https://doi.org/10.1007/s12190-025-02715-6
Bo Zhang, Suxia Ma, & Kai Cao (2026). A global optimization approach utilizing convex relaxation for linear multiplicative programming problems. Journal of Applied Mathematics and Computing. https://doi.org/10.1007/s12190-025-02715-6
Bo Zhang, et al. “A global optimization approach utilizing convex relaxation for linear multiplicative programming problems.” Journal of Applied Mathematics and Computing, 2026. doi:10.1007/s12190-025-02715-6.
@article{Zhang2026,
title = {A global optimization approach utilizing convex relaxation for linear multiplicative programming problems},
author = {Zhang, Bo and Ma, Suxia and Cao, Kai},
journal = {Journal of Applied Mathematics and Computing},
year = {2026},
doi = {10.1007/s12190-025-02715-6},
url = {https://doi.org/10.1007/s12190-025-02715-6}
}