咨询与建议

限定检索结果

文献类型

  • 15 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 14 篇 理学
    • 14 篇 数学
  • 13 篇 管理学
    • 13 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 12 篇 工学
    • 11 篇 软件工程
    • 2 篇 计算机科学与技术...
    • 1 篇 机械工程
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 16 篇 projective algor...
  • 11 篇 linear programmi...
  • 4 篇 karmarkar algori...
  • 4 篇 karmarkar's algo...
  • 3 篇 interior point m...
  • 2 篇 conical projecti...
  • 2 篇 fractional linea...
  • 2 篇 standard form
  • 2 篇 interior methods
  • 1 篇 nondifferentiabl...
  • 1 篇 cutting plane me...
  • 1 篇 homology derivat...
  • 1 篇 karmarkars algor...
  • 1 篇 path-following
  • 1 篇 analytic center
  • 1 篇 interior-point m...
  • 1 篇 rank-one updates
  • 1 篇 pencil of circle...
  • 1 篇 phase i
  • 1 篇 path following

机构

  • 2 篇 univ geneva dept...
  • 1 篇 mcgill univ fac ...
  • 1 篇 univ geneva logi...
  • 1 篇 dept econ commer...
  • 1 篇 yale univ sch ma...
  • 1 篇 yale school of o...
  • 1 篇 1. department of...
  • 1 篇 1. coppe federal...
  • 1 篇 shell dev co wes...
  • 1 篇 south ural state...
  • 1 篇 univ geneva logi...
  • 1 篇 1.yale school of...
  • 1 篇 ecole hautes etu...
  • 1 篇 1. school of ope...
  • 1 篇 mcgill univ fac ...
  • 1 篇 univ catholique ...
  • 1 篇 1. department of...
  • 1 篇 1. department of...

作者

  • 5 篇 vial jp
  • 4 篇 anstreicher km
  • 4 篇 goffin jl
  • 2 篇 gonzaga cc
  • 1 篇 todd mj
  • 1 篇 korotkiy v. a.
  • 1 篇 goldfarb d
  • 1 篇 xiao d
  • 1 篇 khmarova l. i.
  • 1 篇 usmanova e. a.
  • 1 篇 morshedi am
  • 1 篇 turner k
  • 1 篇 haurie a
  • 1 篇 dennis je
  • 1 篇 anstreicher kurt...

语言

  • 16 篇 英文
检索条件"主题词=Projective algorithm"
16 条 记 录,以下是11-20 订阅
INTERIOR POINT algorithmS FOR LINEAR-PROGRAMMING WITH INEQUALITY CONSTRAINTS
收藏 引用
MATHEMATICAL PROGRAMMING 1991年 第2期52卷 209-225页
作者: GONZAGA, CC 1. COPPE Federal University of Rio de Janeiro P.O. Box 68511 21945 Rio de Janeiro RJ Brazil
Interior methods for linear programming were designed mainly for problems formulated with equality constraints and non-negative variables. The formulation with inequality constraints has shown to be very convenient fo... 详细信息
来源: 评论
A COMBINED PHASE-I PHASE-II projective algorithm FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1989年 第2期43卷 209-223页
作者: ANSTREICHER, KM 1.Yale School of Organization and Management Box 1A 06520 New Haven CT USA
We devise a projective algorithm which explicitly considers the constraint that an artificial variable be zero at the solution. Inclusion of such a constraint allows the algorithm to be applied to a (possibly infeasib... 详细信息
来源: 评论
A STANDARD FORM VARIANT, AND SAFEGUARDED LINESEARCH, FOR THE MODIFIED KARMARKAR algorithm
收藏 引用
MATHEMATICAL PROGRAMMING 1990年 第3期47卷 337-351页
作者: ANSTREICHER, KM 1. Department of Operations Research Yale University 06520 New Haven CT USA
In his original analysis of the projective algorithm for linear programming, Karmarkar proposed a “modified method” which improved the worst-case arithmetic complexity of the original algorithm by a factor of $\sqrt... 详细信息
来源: 评论
A Monotonic projective algorithm for Fractional Linear Programming
收藏 引用
algorithmICA 1986年 第1-4期1卷 483-498页
作者: Anstreicher, Kurt M. Yale Univ Sch Management New Haven CT 06520 USA
We demonstrate that Karmarkar's projective algorithm is fundamentally an algorithm for fractional linear programming on the simplex. Convergence for the latter problem is established assuming only an initial lower... 详细信息
来源: 评论
A VARIABLE-METRIC VARIANT OF THE KARMARKAR algorithm FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1987年 第1期39卷 1-20页
作者: DENNIS, JE MORSHEDI, AM TURNER, K SHELL DEV CO WESTHOLLOW RES CTRHOUSTONTX 77001
The most time-consuming part of the Karmarkar algorithm for linear programming is the projection of a vector onto the nullspace of a matrix that changes at each iteration. We present a variant of the Karmarkar algorit... 详细信息
来源: 评论
A STRENGTHENED ACCEPTANCE CRITERION FOR APPROXIMATE PROJECTIONS IN KARMARKAR algorithm
收藏 引用
OPERATIONS RESEARCH LETTERS 1986年 第4期5卷 211-214页
作者: ANSTREICHER, KM Yale School of Organization and Management Box 1A New Haven CT 06520 USA
As described in Goldfarb and Mehrotra [3], the convergence analysis of Karmarkar's method for linear programming leads naturally to an acceptance criterion when approximate projections are used in the course of th... 详细信息
来源: 评论