Revision #922 → #1568 · back to history
addedSimplex algorithm893ad7c0071d
addedCanonical form of a linear program9b02a5f43bbc
addedBasic feasible solution (vertex of feasible polytope)2df4666cf439
addedMaximum attained at an extreme point989bd35d9f9b
addedImproving edge from a non-optimal extreme point892667289c27
addedTermination of the simplex algorithm22316b77dd83
addedInfeasible linear program1a62d961ee4b
addedPhase I and Phase II of the simplex method116c0702ff4e
addedSlack variablecf59da7e49ee
addedSurplus variable43c0c23e143b
addedStandard-form transformation procedure4a0b64ff7a38
addedCanonical form of a simplex tableau004913610160
addedBasic and nonbasic (free) variables6f5112ed6c3a
addedReduction of any BFS to canonical-form tableau6b3bb0cca434
addedPricing out and relative cost coefficientsb3f959ebf4b1
addedPivot operation98dead4c986a
addedEntering and leaving variablescf59bf1be7ca
addedEntering variable selection rulefdf27d5bed4d
addedOptimality when no negative entry in objective rowf569bd0de577
addedUnboundedness criterion in leaving variable selection937a9c5c0ed3
addedMinimum ratio test2aea27cd2f2a
addedSimplex example (Phase II run)fe2b45a0b540
addedArtificial variables and Phase I problem4e49a4e1e328
addedPhase I termination and feasibility characterization71ca5ca3d94a
addedPhase I/II simplex example with equality constraints4c3c3c2eab55
addedStandard simplex algorithm (tableau implementation)f65b4167918a
addedRevised simplex algorithm0ccdf8e14fec
addedDegenerate basic feasible solutione94ffea3548d
addedStalling and cyclingdc9aea8020cd
addedBland's rule prevents cycling5f21bd974082
addedKlee–Minty exponential worst casef9852083acc3
addedNP-mightiness of a simplex variant96acc0f45efd
addedPSPACE-completeness of Dantzig's pivot rule output36ff09e04cfa
addedPolynomial average-case complexity5229f393059e
addedSmoothed analysis of the simplex method00a4f7573ef4
addedLinear-fractional programming8bd0b1b32468