Acta mathematica scientia,Series A ›› 2025, Vol. 45 ›› Issue (2): 630-639.

Previous Articles     Next Articles

On Robust Optimal Solutions for a Class of Uncertain Fractional Polynomial Optimization Problems

Bo Ran(),Xiangkai Sun*(),Xiaole Guo()   

  1. Chongqing Key Laboratory of Statistical Intelligent Computing and Monitoring, School of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067
  • Received:2024-04-11 Revised:2024-09-18 Online:2025-04-26 Published:2025-04-09
  • Contact: Xiangkai Sun E-mail:1308355153@qq.com;sunxk@ctbu.edu.cn;xlguocqu1@163.com
  • Supported by:
    Natural Science Foundation of Chongqing(CSTB2024NSCQ-MSX0651);Team Building Project for Graduate Tutors in Chongqing(yds223010)

Abstract:

Fractional optimization with sum of squares convex-concave polynomials is often involved in the uncertain data processing. This paper is concerned with its robust optimal solutions. We first give optimality conditions of robust optimal solutions for the uncertain fractional polynomial optimization problem in terms of robust optimization and a normal cone constraint qualification condition. Then, we give a robust dual problem to this uncertain fractional polynomial optimization problem and establish robust weak and strong duality properties between them. Moreover, we obtain exact sum of squares relaxation results for this uncertain fractional polynomial optimization problem.

Key words: fractional optimization, robust optimality, robust duality

CLC Number: 

  • O221.6
Trendmd