約束最佳化問題最直接的優化方法便是以數值方法來解決。然而，針對不同類型的約束最佳化問題去設計演算法能夠更提高解決問題的效率。其中，注水法是在通訊領域中經典的演算法之一，常被用於解決資源分配的問題。

該研究旨在探討能夠用注水法解決的不同類型約束最佳化問題，期望擴大注水法所能解決問題的範圍。首先，我們以最典型的資源分配模型為基礎進行研究，描繪出目標函數的特性，以數學證明的方式確保注水法與其最佳解互相對應的正確性。同時，我們還列舉出通訊網路中常見的具有相同性質的模型。

此外，該研究進一步擴展了約束最佳化問題的形式，透過卡羅需-庫恩-塔克條件在約束最佳化問題中做觀察，設計出一注水法相關的演算法來解決問題，我們使用數學證明的方式驗證了演算法的正確性，成功擴展了注水法所能解決的約束最佳化問題類型。

The most direct optimization method for constrained optimization problems is to solve them using numerical methods. However, designing algorithms specifically for different types of constrained optimization problems can enhance problem-solving efficiency. Among them, the water-filling algorithm is one of the classic algorithms, commonly used in the field of communications to address resource allocation problems.

This study aims to explore different classes of constrained optimization problems that can be solved using the water-filling approach, with the goal of expanding the range of problems that can be addressed by this algorithm. Firstly, we conduct research based on the typical resource allocation model, describing the characteristics of the objective function, and mathematically proving the consistency of results between the water-filling and constrained optimization problems. Additionally, we list commonly encountered models in communication that possess the same characteristics.

Furthermore, this study extends the form of constrained optimization problems by observing the Karush-Kuhn-Tucker conditions and designing a water-filling-related approach to address these problems. We provide mathematical proof to validate the correctness of the algorithm and successfully broaden the types of constrained optimization problems that can be solved using the water-filling.

[1] J. Nocedal and S. J. Wright, Numerical optimization. Springer, 1999.
[2] D. Palomar and J. Fonollosa, “Practical algorithms for a family of waterfilling solutions,” IEEE Transactions on Signal Processing, vol. 53, no. 2, pp. 686–695, 2005.
[3] D.-S. Lee, C.-S. Chang, R. Zhang, and M.-P. Lee, “Resource allocation for urllc and embb traffic in uplink wireless networks,” 2022.
[4] D. Palomar, J. Cioffi, and M. Lagunas, “Joint tx-rx beamforming design for multicarrier mimo channels: a unified framework for convex optimization,” IEEE Transactions on Signal Processing, vol. 51, no. 9, pp. 2381–2401, 2003.
[5] B. Radunovic and J.-Y. Le Boudec, “A unified framework for max-min and min-max fairness with applications,” IEEE/ACM Transactions on Networking, vol. 15, no. 5, pp. 1073–1083, 2007.
[6] A. Coluccia, A. D’Alconzo, and F. Ricciato, “On the optimality of max–min fairness in resource allocation,” annals of 51 telecommunications-annales des télécommunications, vol. 67, pp.15–26, 2012.
[7] H. Taub and D. Schilling, Principles of Communication Systems. McGraw-Hill, 1986.
[8] H. Kushner and P. Whiting, “Convergence of proportional-fair sharing algorithms under general conditions,” IEEE Transactions on Wireless Communications, vol. 3, no. 4, pp. 1250–1259, 2004.
[9] R. Jain, D. Chiu, and W. Hawe, “A quantitative measure of fairness and discrimination for resource allocation in shared computer systems,” 1998.