Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
From MaRDI portal
Publication:2097474
DOI10.3934/jimo.2022025OpenAlexW4214596907MaRDI QIDQ2097474
Publication date: 14 November 2022
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022025
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- A continuous-time generalization of Gordan's transposition theorem
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- Optimality conditions and duality for nonsmooth fractional continuous-time problems
- Continuous time linear-fractional programming. The minimum-risk approach
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- A eighth bibliography of fractional programming
- Duality for a class of continuous-time homogeneous fractional programming problems
- Bibliography in fractional programming
- Optimality conditions and duality models for a class of nonsmooth continuous-time fractional programming problems
- A ninth bibliography of fractional programming
- Bottleneck Problems and Dynamic Programming
- Nonsmooth continuous-time optimization problems: Necessary conditions
This page was built for publication: Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
