About: Bland's rule     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatExchangeAlgorithms, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FBland%27s_rule&invfp=IFP_OFF&sas=SAME_AS_OFF

In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement of the simplex method for linear optimization. With Bland's rule, the simplex algorithm solves feasible linear optimization problems without cycling. Such cycles are avoided by Bland's rule for choosing a column to enter and a column to leave the basis.

AttributesValues
rdf:type
rdfs:label
  • Bland's rule (en)
  • Правило Блэнда (ru)
rdfs:comment
  • In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement of the simplex method for linear optimization. With Bland's rule, the simplex algorithm solves feasible linear optimization problems without cycling. Such cycles are avoided by Bland's rule for choosing a column to enter and a column to leave the basis. (en)
  • Правило Блэнда (известное также как алгоритм Блэнда или антицикличное правило Блэнда) — это алгоритмическое уточнение симплекс-метода для линейной оптимизации. С правилом Блэнда алгоритм симплекс-метода решает допустимые задачи линейной оптимизации без зацикливания. Существуют примеры вырожденных задач оптимизации, на которых оригинальный симплекс-метод переходит в бесконечный цикл. Такое зацикливание предотвращает правило Блэнда выбора столбца при вводе в базис. (ru)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement of the simplex method for linear optimization. With Bland's rule, the simplex algorithm solves feasible linear optimization problems without cycling. The original simplex algorithm starts with an arbitrary basic feasible solution, and then changes the basis in order to decrease the minimization target and find an optimal solution. Usually, the target indeed decreases in every step, and thus after a bounded number of steps an optimal solution is found. However, there are examples of degenerate linear programs, on which the original simplex algorithm cycles forever. It gets stuck at a basic feasible solution (a corner of the feasible polytope) and changes bases in a cyclic way without decreasing the minimization target. Such cycles are avoided by Bland's rule for choosing a column to enter and a column to leave the basis. Bland's rule was developed by Robert G. Bland, now an Emeritus Professor of operations research at Cornell University, while he was a research fellow at the Center for Operations Research and Econometrics in Belgium. (en)
  • Правило Блэнда (известное также как алгоритм Блэнда или антицикличное правило Блэнда) — это алгоритмическое уточнение симплекс-метода для линейной оптимизации. С правилом Блэнда алгоритм симплекс-метода решает допустимые задачи линейной оптимизации без зацикливания. Существуют примеры вырожденных задач оптимизации, на которых оригинальный симплекс-метод переходит в бесконечный цикл. Такое зацикливание предотвращает правило Блэнда выбора столбца при вводе в базис. Правило Блэнда разработал Роберт Г. Блэнд, ныне профессор в области исследования операций в Корнеллском университете, когда он был научным сотрудником центра исследования операций и эконометрики в Бельгии. (ru)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 50 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software