Simplex algorithm - Revision history

Alextejthompson: Added {{no sources}} tag to article (TW)

2015-09-01T01:02:43Z

Added {{no sources}} tag to article (TW)

← Older revision		Revision as of 01:02, 1 September 2015
Line 1:		Line 1:
			{{no sources\|date=September 2015}}
	[[File:Simplex-method-3-dimensions.png\|thumb\|The red line is one solution of the problem.]]		[[File:Simplex-method-3-dimensions.png\|thumb\|The red line is one solution of the problem.]]
	The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:		The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:

76.7.232.143 at 21:02, 16 February 2014

2014-02-16T21:02:14Z

← Older revision		Revision as of 21:02, 16 February 2014
Line 2:		Line 2:
	The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:		The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:
	#First a solution to the problem is found, or the certainty that no solution exists.		#First a solution to the problem is found, or the certainty that no solution exists.
	#The solution found earlier is improved, if this is possible.		#The solution found earlier is improved, if this is possible.
	Step 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.		Step 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.

	{{stub}}
			{{multistub\|math\|tech}}

	[[Category:Combinatorial optimization]]		[[Category:Combinatorial optimization]]

Eptalon at 16:28, 19 December 2013

2013-12-19T16:28:19Z

← Older revision		Revision as of 16:28, 19 December 2013
Line 2:		Line 2:
	The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:		The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:
	#First a solution to the problem is found, or the certainty that no solution exists.		#First a solution to the problem is found, or the certainty that no solution exists.
	#The solution found is improved.		#The solution found earlier is improved, if this is possible.
	Step 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.		Step 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.
	{{stub}}		{{stub}}

Eptalon at 16:23, 19 December 2013

2013-12-19T16:23:23Z

← Older revision		Revision as of 16:23, 19 December 2013
Line 1:		Line 1:
	[[File:Simplex-method-3-dimensions.png\|thumb\|The red line is one solution of the problem.]]		[[File:Simplex-method-3-dimensions.png\|thumb\|The red line is one solution of the problem.]]
	The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two ~~distinct~~ steps:		The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two steps:
	#First a solution to the problem is found, or the certainty that no solution exists.		#First a solution to the problem is found, or the certainty that no solution exists.
	#The solution found is improved.		#The solution found is improved.
	~~Phase~~ 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.		Step 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.
	{{stub}}		{{stub}}

Eptalon at 16:22, 19 December 2013

2013-12-19T16:22:20Z

← Older revision		Revision as of 16:22, 19 December 2013
Line 1:		Line 1:
			[[File:Simplex-method-3-dimensions.png\|thumb\|The red line is one solution of the problem.]]
	The '''Simplex algorithm''' is an [[algorithm]] which is used to solve ~~problemsof~~ [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two distinct steps:		The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two distinct steps:
	#First a solution to the problem is found, or the certainty that no solution exists.		#First a solution to the problem is found, or the certainty that no solution exists.
	#The solution found is improved.		#The solution found is improved.

Thrasymedes: Typo fixing, typos fixed: certainity → certainty using AWB

2013-12-19T16:01:20Z

Typo fixing, typos fixed: certainity → certainty using AWB

← Older revision		Revision as of 16:01, 19 December 2013
Line 1:		Line 1:
	The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problemsof [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The ~~alfgorithm~~ runs in two distinct steps:		The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problemsof [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The algorithm runs in two distinct steps:
	#First a solution to the problem is found, or the ~~certainity~~ that no solution exists.		#First a solution to the problem is found, or the certainty that no solution exists.
	#The solution found is improved.		#The solution found is improved.
	Phase 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.		Phase 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.

Eptalon: removed Category:Linear algebra; added Category:Combinatorial optimization using HotCat

2013-12-18T21:15:56Z

removed Category:Linear algebra; added Category:Combinatorial optimization using HotCat

← Older revision		Revision as of 21:15, 18 December 2013
Line 5:		Line 5:
	{{stub}}		{{stub}}

	[[Category:~~Linear~~ ~~algebra~~]]		[[Category:Combinatorial optimization]]

Eptalon: added Category:Linear algebra using HotCat

2013-12-18T21:15:21Z

added Category:Linear algebra using HotCat

← Older revision		Revision as of 21:15, 18 December 2013
Line 4:		Line 4:
	Phase 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.		Phase 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.
	{{stub}}		{{stub}}

			[[Category:Linear algebra]]

Eptalon: Created page with "The '''Simplex algorithm''' is an algorithm which is used to solve problemsof Linear programming or linear optimization. It was first used by George Dantzig in 194..."

2013-12-18T21:14:59Z

Created page with "The '''Simplex algorithm''' is an algorithm which is used to solve problemsof Linear programming or linear optimization. It was first used by George Dantzig in 194..."

New page

The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problemsof [[Linear programming]] or linear optimization. It was first used by [[George Dantzig]] in 1947, but other people like [[Kantorovich]] laid the foundations in 1939. The alfgorithm runs in two distinct steps:
#First a solution to the problem is found, or the certainity that no solution exists.
#The solution found is improved.
Phase 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.
{{stub}}