Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
From MaRDI portal
Publication:2097474
Recommendations
- OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS
- Optimality criteria and duality for nonlinear fractional continuous-time programming
- Continuous-time fractional minmax programming
- Optimality conditions and duality for nonsmooth fractional continuous-time problems
- Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
Cites work
- scientific article; zbMATH DE number 3427125 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 192888 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- A continuous-time generalization of Gordan's transposition theorem
- A eighth bibliography of fractional programming
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Bibliography in fractional programming
- Bibliography: Ninth bibliography of fractional programming
- Bottleneck Problems and Dynamic Programming
- Carathéodory-John--type sufficiency criteria in continuous-time nonlinear programming under generalized \((\alpha,\rho)-(\eta,\theta)-\)type I invexity
- Continuous time linear-fractional programming. The minimum-risk approach
- Duality for a class of continuous-time homogeneous fractional programming problems
- Nonsmooth continuous-time optimization problems: Necessary conditions
- Optimality conditions and duality for nonsmooth fractional continuous-time problems
- Optimality conditions and duality models for a class of nonsmooth continuous-time fractional programming problems
- Sufficiency criteria in continuous-time nonlinear programming under generalized \((\alpha,\rho)-(\eta,\theta)\)-type I inverxity
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
Cited in
(7)- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
- Optimality conditions and duality for nonsmooth fractional continuous-time problems
- scientific article; zbMATH DE number 5629782 (Why is no real title available?)
- Optimality conditions and duality for a class of continuous-time linear optimization problems
- Saddle-point type optimality criteria for generalized fractional programming
- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
- Optimality criteria and duality for nonlinear fractional continuous-time programming
This page was built for publication: Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097474)