吉林大学学报(工学版) ›› 2000, Vol. 30 ›› Issue (01): 53-56.

• 论文 • 上一篇    下一篇

解非线性凸规划问题的组合同伦法的较弱条件

迟雅敬, 褚铭   

  1. 吉林工业大学理学院, 吉林 长春 130025
  • 收稿日期:1999-03-16 出版日期:2000-01-25 发布日期:2000-01-25
  • 作者简介:迟雅敬(1965- ),女,吉林农安人,吉林工业大学讲师.
  • 基金资助:

    国家自然科学基金资助项目(19771043)

A Weaker Condition of Combined Homotopy Interior Point Method for Solving Nonlinear Convex Programming

CHI Ya-jing, CHU Ming   

  1. College of Sciences, Jilin University of Technology, Changchun 130025, China
  • Received:1999-03-16 Online:2000-01-25 Published:2000-01-25

摘要:

文献[1]讨论了在线性无关的约束规定下,用组合同伦内点法求解非线性规划的K-T点问题。本文证明了当可行解域为凸集时,不在线性无关的条件下文献[1]中的结论仍成立。

关键词: 非线性规划, 组合同伦内点法, K-T点, 约束规定

Abstract:

The problem for getting K-T point of nonlinear programming by combined homotopy interior point method under linearly independent constraint qualification is discussed at [1].This paper has proved that the conclusion at [1] is held without the condition of linearly independent when feasible field is a convex.

Key words: nonlinear programming, combined homotopy interior point method, K-T point, constraint qualification

中图分类号: 

  • O221


[1] Feng G C, Lin Z H, Yu B. Existence of an interidr pathway to a Kurush-Kuhn-Tucker point of a nonconvex programming problem
[J]. Nonlinear Analaysis, Theory, Methods & Applications, 1998, 32(6): 761-768.

[2] Wang Y, Feng G C, Lin Z H. Interior point algrithm for convex nonlinear programming problems
[J]. Numerical Mathematics, J. Chinese Universities, 1992, I(1): 1-8.

[3] 迟雅敬,董加礼,刘庆怀.解非线性凸规划问题的组合同伦内点法的推广
[J].华中师范大学学报(专辑), 1998.

[1] 陈鹏1,2,严新平1,2,李旭宏3,吴超仲1,2. 轨道交通与常规公交计划调度协调模型[J]. 吉林大学学报(工学版), 2011, 41(4): 950-955.
[2] 马飞,吴梦娜,孙宝凤,杨华. 大规模定制下的供应链调度建模与仿真[J]. 吉林大学学报(工学版), 2009, 39(增刊2): 337-0340.
[3] 赵伟;李文辉;夏云飞 . 基于非线性规划的凸多面体间碰撞检测算法[J]. 吉林大学学报(工学版), 2008, 38(03): 676-0679.
[4] 迟雅敬, 褚铭. 非线性非凸规划内点法的推广[J]. 吉林大学学报(工学版), 2000, (3): 68-71.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!