Devex algorithm - Revision history

Frap: Full name

2019-11-25T10:56:03Z

Full name

← Previous revision		Revision as of 10:56, 25 November 2019
Line 1:		Line 1:
	{{refimprove\|date=August 2013}}		{{refimprove\|date=August 2013}}
	In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 Pivot selection methods of the Devex LP code]." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and [[Donald Goldfarb]]. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref>		In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Paula M. J. Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 Pivot selection methods of the Devex LP code]." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and [[Donald Goldfarb]]. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref>

	==References==		==References==

Certes: +wikilink

2018-02-26T13:45:52Z

+wikilink

← Previous revision		Revision as of 13:45, 26 February 2018
Line 1:		Line 1:
	{{refimprove\|date=August 2013}}		{{refimprove\|date=August 2013}}
	In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 Pivot selection methods of the Devex LP code]." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref>		In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 Pivot selection methods of the Devex LP code]." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and [[Donald Goldfarb]]. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref>

	==References==		==References==

Jarble: adding links to references using Google Scholar

2018-02-14T00:20:24Z

adding links to references using Google Scholar

← Previous revision		Revision as of 00:20, 14 February 2018
Line 1:		Line 1:
	{{refimprove\|date=August 2013}}		{{refimprove\|date=August 2013}}
	In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.</ref>		In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 Pivot selection methods of the Devex LP code]." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref>

	==References==		==References==

David Eppstein: {{algorithm-stub}}

2013-10-03T21:51:18Z

← Previous revision		Revision as of 21:51, 3 October 2013
Line 8:		Line 8:


	{{~~math~~-stub}}		{{algorithm-stub}}

BG19bot: WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB (9421)

2013-08-14T21:28:05Z

WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB (9421)

← Previous revision		Revision as of 21:28, 14 August 2013
Line 1:		Line 1:
	{{~~ref improve~~\|date=August 2013}}		{{refimprove\|date=August 2013}}
	In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1–28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.</ref>		In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.</ref>

	==References==		==References==
	{{reflist}}		{{reflist}}

		⚫	[[Category:Algorithms]]
⚫	{{math-stub}}


		⚫	{{math-stub}}
⚫	[[Category:Algorithms]]

Michael Hardy at 02:38, 3 August 2013

2013-08-03T02:38:47Z

← Previous revision		Revision as of 02:38, 3 August 2013
Line 1:		Line 1:
	{{ref improve\|date=August 2013}}		{{ref improve\|date=August 2013}}
	'''~~Devex~~ algorithm''' is a pivot rule for the [[~~Simplex~~ ~~Method~~]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): ~~1-28~~.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.~~1-3~~ (1992): ~~341-374~~.</ref>		In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1–28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.</ref>

	==References==		==References==

Auric: added Category:Algorithms; removed {{uncategorized}} using HotCat

2013-08-02T14:11:33Z

added Category:Algorithms; removed {{uncategorized}} using HotCat

← Previous revision		Revision as of 14:11, 2 August 2013
Line 6:		Line 6:

	{{math-stub}}		{{math-stub}}

	{{Uncategorized stub\|date=August 2013}}

			[[Category:Algorithms]]

Auric at 14:10, 2 August 2013

2013-08-02T14:10:21Z

← Previous revision		Revision as of 14:10, 2 August 2013
Line 1:		Line 1:
	{{~~Unsourced~~\|date=August 2013}}		{{ref improve\|date=August 2013}}
	'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1-28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.		'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1-28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1-3 (1992): 341-374.</ref>

			==References==
			{{reflist}}

	{{stub}}		{{math-stub}}
	{{Uncategorized stub\|date=August 2013}}		{{Uncategorized stub\|date=August 2013}}

	<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1-3 (1992): 341-374.</ref>

Qx2020: added source

2013-08-02T09:41:53Z

added source

← Previous revision		Revision as of 09:41, 2 August 2013
Line 1:		Line 1:
	{{Unsourced\|date=August 2013}}		{{Unsourced\|date=August 2013}}
	'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris. It identifies the steepest-edge approximately in its search for the optimal solution.		'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1-28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.


	{{stub}}		{{stub}}
	{{Uncategorized stub\|date=August 2013}}		{{Uncategorized stub\|date=August 2013}}

			<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1-3 (1992): 341-374.</ref>

Fram: Unsourced, added stub, uncategorised tags using AWB

2013-08-02T08:40:08Z

Unsourced, added stub, uncategorised tags using AWB

← Previous revision		Revision as of 08:40, 2 August 2013
Line 1:		Line 1:
			{{Unsourced\|date=August 2013}}
		⚫	'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris. It identifies the steepest-edge approximately in its search for the optimal solution.


⚫	Devex algorithm is a pivot rule for the [[Simplex Method]] developed by Harris. It identifies the steepest-edge approximately in its search for the optimal solution.
			{{stub}}
			{{Uncategorized stub\|date=August 2013}}