Simplex-Algorithm

Will soon be available.

The following example is similar to an introducery example by Neumann and Morlock (1993, p. 73):

		x1	+	3	x2	→	max
s. t.
		x1	+	2	x2	≤	110
		x1	+	4	x2	≤	160
		x1	+		x2	≤	100
					xi	∈	ℝ+

The above example is given in standard form. Moreover, the origin (0, 0) is a feasible basic solution. Thus, the primal simplex method can be applied straight forwardly.

Note: Neumann and Morlock consider minimization problems as standard problems. Respectively, they denote the objective of the above problem as - x₁ - 3 x₂ → min.

Load example

Example LP 1.1 from Section “1.1 Grundlegende Begriffe und Notation”:

		x1	+		x2	→	max
s. t.
		x1	-		x2	≥	-1
	2	x1	+		x2	≤	4
					xi	∈	R+

Since the first constraint is a “≥”-inequality, the above example is not given in standardform.

Load example