Bibliographic Details
| Title: |
Robust Optimization Approach for Solving Uncertain Multiobjective Optimization Problems Using the Projected Gradient Method |
| Authors: |
Kumar, Shubham, Mahatoa, Nihar Kumar, Ghosh, Debdas |
| Publication Year: |
2025 |
| Collection: |
Mathematics |
| Subject Terms: |
Mathematics - Optimization and Control |
| More Details: |
Numerous real-world applications of uncertain multiobjective optimization problems (UMOPs) can be found in science, engineering, business, and management. To handle the solution of uncertain optimization problems, robust optimization is a relatively new field. An extended version of the projected gradient method (PGM) for a deterministic smooth multiobjective optimization problem (MOP) is presented in the current study as a PGM for UMOP. An objective-wise worst-case cost (OWWC) type robust counterpart is considered, and the PGM is used to solve a UMOP by using OWWC. A projected gradient descent algorithm is created using theoretical findings. It is demonstrated that the projected gradient descent algorithm's generated sequence converges to the robust counterpart's weak Pareto optimal solution, which will be the robust weak Pareto optimal solution for UMOP. Under a few reasonable presumptions, the projected gradient descent algorithm's full convergent behavior is also justified. Finally, numerical tests are presented to validate the proposed method. |
| Document Type: |
Working Paper |
| Access URL: |
http://arxiv.org/abs/2503.06509 |
| Accession Number: |
edsarx.2503.06509 |
| Database: |
arXiv |
