数学季刊 ›› 2006, Vol. 21 ›› Issue (4): 553-556.

• • 上一篇    下一篇

带有约束线性分式规划问题的最优性条件

  


  1. 1. Department of Mathematics,Jiaozuo Teacher's College  2. Department of Mathematics,Zhengzhou University 

  • 收稿日期:2003-12-17 出版日期:2006-12-30 发布日期:2023-11-21
  • 作者简介:SUN Jian-she(1965-),male,native of Wuzhi,Henan,an associate professor of Jiaozuo Teachers College,M.S.D.,engages in mathematical inequalities and theory of special functions and its applications;YE Liu-qing(1965),male,native of Runan,Henan,an associate profesor of Jiaozuo Teacher's Collge,M.S.D., engages in nonlinear programming.
  • 基金资助:
    Supported by the Natural Science Foundation of Henan Province(0511012000 0511013600); Supported by the Science Foundation for Pure Research of Natural Science of the Education Department of Henan Province(200512950001);

The Optimal Conditions of the Linear Fractional Programming Problem with Constraint


  1. 1. Department of Mathematics,Jiaozuo Teacher's College  2. Department of Mathematics,Zhengzhou University 
  • Received:2003-12-17 Online:2006-12-30 Published:2023-11-21
  • About author:SUN Jian-she(1965-),male,native of Wuzhi,Henan,an associate professor of Jiaozuo Teachers College,M.S.D.,engages in mathematical inequalities and theory of special functions and its applications;YE Liu-qing(1965),male,native of Runan,Henan,an associate profesor of Jiaozuo Teacher's Collge,M.S.D., engages in nonlinear programming.
  • Supported by:
    Supported by the Natural Science Foundation of Henan Province(0511012000 0511013600); Supported by the Science Foundation for Pure Research of Natural Science of the Education Department of Henan Province(200512950001);

摘要: In this article,the authors discuss the optimal conditions of the linear fractional programming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution with constraint condition.

关键词: linear ,  , fractional ,  , programming ,  ,  problem;pseudo-convex ,  , function;optimal ,  , solu-
tion;constraint

Abstract: In this article,the authors discuss the optimal conditions of the linear fractional programming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution with constraint condition.

Key words: linear ,  , fractional ,  , programming ,  ,  problem;pseudo-convex ,  , function;optimal ,  , solu-
tion;constraint

中图分类号: