Continuous-time fractional minmax programming
نویسندگان
چکیده
منابع مشابه
Second order duality for minmax fractional programming
In the present paper, two types of second order dual models are formulated for a minmax fractional programming problem. The concept of η-bonvexity/ generalized η-bonvexity is adopted in order to discuss weak, strong and strict converse duality theorems.
متن کاملGeneralized second-order parametric optimality conditions in semiinfinite discrete minmax fractional programming and second order (F
This paper deals with mainly establishing numerous sets of generalized second-order parametric sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem are achieved based on some partitioning schemes under various types of generalized second-order (F ,β, φ, ρ, θ, m)-univex...
متن کاملOptimality Conditions and Duality in Minmax Fractional Programming, Part I: Necessary and Sufficient Optimality Conditions
The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized (F, b, φ, ρ, θ)univexity assumptions for a continuous minmax fractional programming problem involving arbitrary norms.
متن کاملMultivariable Identification of Continuous-time Fractional System
ABSTRACT This paper presents two subspace-based methods, from the MOESP (MIMO output-error state space) family, for state-space identification of continuous-time fractional commensurate models from sampled input-output data. The methodology used in this paper involves a continuous-time fractional operator allowing to reformulate the problem so that the state-space matrices can be estimated with...
متن کاملDynamic Programming for Fractional Discrete-Time Systems
Abstract: Dynamic programming problem for fractional discrete-time systems with quadratic performance index has been formulated and solved. A new method for numerical computation of optimal dynamic programming problem has been presented. The efficiency of the method has been demonstrated on numerical example and illustrated by graphs. Graphs also show the differences between the fractional and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2005
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2003.10.055