Zadeh's rule
id:
zadeh-s-rule-280-4094992
title:
Zadeh's rule
text:
In mathematical optimization, Zadeh's rule is an algorithmic refinement of the simplex method for linear optimization. The rule was proposed around 1980 by Norman Zadeh, and has entered the folklore of convex optimization since then. Zadeh offered a reward of $1,000 to anyone who can show that the rule admits polynomially many iterations or to prove that there is a family of linear programs on which the pivoting rule requires subexponentially many iterations to find the optimum.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Zadeh%27s_rule
date created:
date modified:
2023-04-16T09:08:58Z
main entity:
{"identifier":"Q49000180","url":"https://www.wikidata.org/entity/Q49000180"}
image:
fields total:
13
integrity:
13