Related Experiment Video
Updated: Nov 15, 2025

WheelCon: A Wheel Control-Based Gaming Platform for Studying Human Sensorimotor Control
Published on: August 15, 2020
Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data
Jiawei Chen1, Suliman Al-Homidan2, Qamrul Hasan Ansari2,3
1School of Mathematics and Statistics, Southwest University, Chongqing, 400715 China.
Abstract:
In this paper, we study robust necessary optimality conditions for a nondifferentiable complex fractional programming with uncertain data. A robust counterpart of uncertain complex fractional programming is introduced in the worst-case scenario. The concept of robust optimal solution of the uncertain complex fractional programming is introduced by using robust counterpart. We give an equivalence between the optimal solutions of the robust counterpart and a minimax nonfractional parametric programming. Finally, Fritz John-type and Karush-Kuhn-Tucker-type robust necessary optimality conditions of the uncertain complex fractional programming are established under some suitable conditions.
More Related Videos
Related Concept Videos
Application of Nonlinear Inequalities
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Introduction to Nonlinear Inequalities
Statically Indeterminate Problem Solving
Piecewise-Defined Functions
Propagation of Uncertainty from Random Error

