• ISSN 0258-2724
  • CN 51-1277/U
  • EI Compendex
  • Scopus
  • Indexed by Core Journals of China, Chinese S&T Journal Citation Reports
  • Chinese S&T Journal Citation Reports
  • Chinese Science Citation Database
Volume 15 Issue 5
Oct.  2002
Turn off MathJax
Article Contents
CHEN Gao-bo, LIUHai-yan, SHANG Sheng-wu. Linear Approximation Algorithm for Bilinear Programming[J]. Journal of Southwest Jiaotong University, 2002, 15(5): 561-564.
Citation: CHEN Gao-bo, LIUHai-yan, SHANG Sheng-wu. Linear Approximation Algorithm for Bilinear Programming[J]. Journal of Southwest Jiaotong University, 2002, 15(5): 561-564.

Linear Approximation Algorithm for Bilinear Programming

  • Publish Date: 25 Oct 2002
  • A discussion is made of the optimization of a bilinear programming. The bilinear programming is converted into a max-min problem on the principle of duality, and a linear approximation algorithm for the max-min problem is presented, which proves to be convergent in finite steps. It is also shown that using Karmarkar algorithm to optimize the initial iteration point can make the linear approximation more effective.

     

  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Article views(1461) PDF downloads(241) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return