scientific article; zbMATH DE number 7479364
From MaRDI portal
Publication:5035927
zbMath1499.90242MaRDI QIDQ5035927
Publication date: 22 February 2022
Full work available at URL: https://www.global-sci.org/intro/article_detail/ijnam/19953.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Continuous-time fractional minmax programming
- Sufficient optimality conditions in continuous-time nonlinear programming
- A continuous-time generalization of Gordan's transposition theorem
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- Continuous time programming with nonlinear constraints
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- Parameter-free dual models for fractional programming with generalized invexity
- Optimality conditions and duality for nonsmooth fractional continuous-time problems
- A class of continuous convex programming problems
- Continuous time linear-fractional programming. The minimum-risk approach
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Duality for a class of continuous-time homogeneous fractional programming problems
- Optimality and duality in continuous-time nonlinear fractional programming
- OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS
- Necessary conditions for continuous-time optimization under the Mangasarian–Fromovitz constraint qualification
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Duality for a Class of Infinite Programming Problems
- Bottleneck Problems and Dynamic Programming
- Unnamed Item