咨询与建议

限定检索结果

文献类型

  • 7 篇 期刊文献

馆藏范围

  • 7 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 7 篇 理学
    • 7 篇 数学
    • 1 篇 统计学(可授理学、...
  • 5 篇 工学
    • 4 篇 计算机科学与技术...
    • 3 篇 控制科学与工程
    • 3 篇 石油与天然气工程
    • 1 篇 软件工程
  • 5 篇 管理学
    • 5 篇 管理科学与工程(可...

主题

  • 7 篇 parametric simpl...
  • 4 篇 global optimizat...
  • 2 篇 nonconvex quadra...
  • 1 篇 linear multiplic...
  • 1 篇 probabilistic an...
  • 1 篇 bilinear-program...
  • 1 篇 outer-approximat...
  • 1 篇 most preferred n...
  • 1 篇 multiple objecti...
  • 1 篇 reverse convex p...
  • 1 篇 minimization of ...
  • 1 篇 bilinear program...
  • 1 篇 multiple criteri...
  • 1 篇 rank-two quasico...
  • 1 篇 linear fractiona...
  • 1 篇 global minimizat...
  • 1 篇 branch and bound...
  • 1 篇 complexity

机构

  • 3 篇 department of in...
  • 2 篇 institute of hum...
  • 1 篇 institute of inf...
  • 1 篇 univ tsukuba ins...
  • 1 篇 tokyo inst techn...
  • 1 篇 univ tsukuba ins...
  • 1 篇 department of sy...
  • 1 篇 institute of hum...
  • 1 篇 univ tsukuba ins...
  • 1 篇 univ essex dept ...

作者

  • 3 篇 konno hiroshi
  • 3 篇 yajima yasutoshi
  • 2 篇 konno h
  • 2 篇 kuno t
  • 1 篇 salhi abdellah
  • 1 篇 yamamoto y
  • 1 篇 kuno takahito
  • 1 篇 abe n
  • 1 篇 nyiam paschal b.
  • 1 篇 matsui tomomi

语言

  • 7 篇 英文
检索条件"主题词=parametric simplex algorithm"
7 条 记 录,以下是1-10 订阅
排序:
parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial
收藏 引用
Computational Optimization and Applications 1992年 第2期1卷 227-239页
作者: Konno, Hiroshi Kuno, Takahito Yajima, Yasutoshi Institute of Human and Social Sciences Tokyo Institute of Technology Tokyo Japan Institute of Information Sciences and Electronics University of Tsukuba Tsukuba Japan Department of Industrial Engineering and Management Tokyo Institute of Technology Tokyo Japan
We will show that the average number of steps of parametric simplex algorithms for obtaining global minima of rank-one and rank-two bilinear-programming problems are lower-order polynomial functions of the problem siz... 详细信息
来源: 评论
parametric simplex algorithms for solving a special class of nonconvex minimization problems
收藏 引用
Journal of Global Optimization 1991年 第1期1卷 65-81页
作者: Konno, Hiroshi Yajima, Yasutoshi Matsui, Tomomi Institute of Human and Social Sciences Tokyo Institute of Technology Tokyo 152 2-12-1 Oh-Okayama Meguru-ku Japan Department of Industrial Engineering and Management Tokyo Institute of Technology Tokyo Japan Department of System Sciences Tokyo Institute of Technology Tokyo Japan
It is shown that parametric linear programming algorithms work efficiently for a class of nonconvex quadratic programming problems called generalized linear multiplicative programming problems, whose objective functio... 详细信息
来源: 评论
Minimization of the sum of three linear fractional functions
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 1999年 第4期15卷 419-432页
作者: Konno, H Abe, N Tokyo Inst Technol Dept Ind Engn & Management Tokyo 152 Japan
In this paper, we will propose an efficient and reliable heuristic algorithm for minimizing and maximizing the sum of three linear fractional functions over a polytope. These problems are typical nonconvex minimizatio... 详细信息
来源: 评论
A finite algorithm for globally optimizing a class of rank-two reverse convex programs
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 1998年 第3期12卷 247-265页
作者: Kuno, T Yamamoto, Y Univ Tsukuba Inst Informat Sci & Elect Tsukuba Ibaraki 305 Japan Univ Tsukuba Inst Policy & Planning Sci Tsukuba Ibaraki 305 Japan
In this paper, we propose an algorithm for solving a linear program with an additional rank-two reverse convex constraint. Unlike the existing methods which generate approximately optimal solutions, the algorithm prov... 详细信息
来源: 评论
LINEAR MULTIPLICATIVE PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1992年 第1期56卷 51-64页
作者: KONNO, H KUNO, T UNIV TSUKUBA INST INFORMAT SCI & ELECTRTSUKUBAIBARAKI 305JAPAN
An algorithm for solving a linear multiplicative programming problem (referred to as LMP) is proposed. LMP minimizes the product of two linear functions subject to general linear constraints. The product of two linear... 详细信息
来源: 评论
Efficient algorithms for solving rank two and rank three bilinear programming problems
收藏 引用
Journal of Global Optimization 1991年 第2期1卷 155-171页
作者: Yajima, Yasutoshi Konno, Hiroshi Department of Industrial Engineering and Management Tokyo Institute of Technology Japan Institute of Human and Social Sciences Tokyo Institute of Technology Japan
Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure... 详细信息
来源: 评论
A comparative study of two key algorithms in multiple objective linear programming
收藏 引用
JOURNAL OF algorithmS & COMPUTATIONAL TECHNOLOGY 2019年 第13期13卷 -页
作者: Nyiam, Paschal B. Salhi, Abdellah Univ Essex Dept Math Sci Wivenhoe Pk Colchester CO4 3SQ Essex England
Multiple objective linear programming problems are solved with a variety of algorithms. While these algorithms vary in philosophy and outlook, most of them fall into two broad categories: those that are decision space... 详细信息
来源: 评论