一类非光滑广义分式规划的Kuhn-Tucker型最优性必要条件

考虑一类非线性不等式约束的非光滑minimax分式规划问题;目标函数中的分子是可微函数与凸函数之和形式而分母是可微函数与凸函数之差形式,且约束函数是可微的.在Arrow- Hurwicz-Uzawa约束品性下,给出了这类规划的最优解的Kuhn-Tucker型必要条件.所得结果改进和推广了已有文献中的相应结果.     

一类非光滑多目标规划的K-T必要条件

本文对一类由可微函数与凸函数之和形式组成目标函数的多目标规划，分别在Kuhn-Tucker约束品性和Arrow—Hurwicz—Uzawa约束品性下，给出了其弱有效解的K—T必要条件，并给出了其特例(目标函数含||Bx||p的情形)的K—T必要条件，从而推广和改进了已有的结果。     

一类多目标广义分式规划问题的最优性条件和对偶

研究了一类不可微多目标广义分式规划问题．首先,在广义Abadie约束品性条件下,给出了其真有效解的Kuhn—Tucker型必要条件．随后,在（C,a,P,d）一凸性假设下给出其真有效解的充分条件．最后,在此基础上建立了一种对偶模型,证明了对偶定理．得到的结果改进了相关文献中的相应结论．     

一类复合不可微规划的二阶最优性条件

本文给出了一类复合不可微规划的二阶最优性条件,拓广了R·Fletcher的结论.     

一类不可微分式规划的最优性讨论

一、引言 分式规划是一类重要的数学规划问题，对可微分式规划问题许多学者都已较系统的     

一类不可微规划的多项式型算法

本文考虑了由教育最优投资问题导出的一类不可微规划，讨论了可行解是最优解的充要条件，在对乘子作某些假设下，利用Kuhu－Tucker定理给出了求解的一种多项式算法．     

一类非凸不可微规划的算法

讨论一类带非凸不可微函数约束的非凸不可微规划的求解．提出一种基于分枝定界技巧的算法,该算法具有全局收敛性。     

广义分式规划中的鞍点存在性定理

利用向量值广义凸函数等概念,讨论了一类不可微广义分布式规划的Lagrange函数,在适当条件下,证明了广义分式规划中的鞍点存在性定理。     

一类可微规划的多项式型算法

本文考虑了由教育最成投资问题导出的一类不可微规划，讨论了可行解是最优解的充要条件，在对乘子作某些假设下，利用Ｋｕｈ－Ｔｕｃｋｅｒ定理给出了求解的一种多项式算法。     

Necessary and Sufficient Conditions for Minimax Fractional Programming

We establish the necessary and sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems solving generalized convex functions. Subsequently, we apply the optimality conditions to formulate one parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems.     

Second-Order Duality for Nondifferentiable Minimax Programming Involving Generalized Type I Functions

We apply the optimality conditions of nondifferentiable minimax programming to formulate a general second-order Mond-Weir dual to the nondifferentiable minimax programming involving second-order pseudo-quasi Type I functions. We establish also weak, strong, and strict converse duality theorems.Research supported by the Council of Scientific and Industrial Research, New Delhi, India, Research Scheme-25 (0132)/04/EMR-II.     

Optimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity

We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)-convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems. The authors thank the referee for valuable suggestions improving the presentation of the paper.     

(h,ψ)-数学规划问题的必要条件

给出了（h,ψ）-η伪凸函数的概念，利用Ben-Tal广义代数运算讨论了它与η－伪凸函数之间的关系。当目标函数和约束函数均为（h,ψ）-可微函数时，在广义Slater约束规格下，得到了相应规划问题取得最优解的Kuhn-Tucker必要条件。     

多目标规划有效解的Kuhn—Tucker必要条件

本文提出一个新的约束规格,导出可微多目标规划的有效解的Kuhn-Tucker必要条件,并证明在此条件下,有效解是Kuhn-Tucker真有效解。     

Complex Minimax Fractional Programming of Analytic Functions

We prove that a minmax fractional programming problem is equivalent to a minimax nonfractional parametric problem for a given parameter in complex space. Using a parametric approach, we establish the Kuhn-Tucker type necessary optimality conditions and prove the existence theorem of optimality for complex minimax fractional programming in the framework of generalized convexity. Subsequently, we apply the optimality conditions to formulate a one-parameter dual problem and prove weak duality, strong duality, and strict converse duality theorems involving generalized convex complex functions. This research was partly supported by NSC, Taiwan.     

Optimality and Duality for a Class of Nondifferentiable Multiobjective Fractional Programming Problems

In this paper, we consider a class of nondifferentiable multiobjective fractional programs in which each component of the objective function contains a term involving the support function of a compact convex set. We establish necessary and sufficient optimality conditions and duality results for weakly efficient solutions of nondifferentiable multiobjective fractional programming problems. This work was supported by Grant R01-2003-000-10825-0 from the Basic Research Program of KOSEF.     

离散型Lurie控制系统绝对稳定的充分必要条件

本文研究了离散型Lurie控制系统(1)在非线性函数f(σ)满足f(0)=0,σf(σ)>0(σ≠0)(2)或f(0)=0,0≤k₁≤f(σ)/σ≤k₂<+∞(σ≠0)(3)时,零解的绝对稳定性。给出了系统(1)在满足条件(2)时零解绝对稳定的构造性充要条件,并得到了系统(1)的简化系统在满足条件(3)时,绝对稳定的充分及充要判据。