Self-dual parametric algorithm
- 18 Downloads
A variation of the simplex method and parametric programming in which the given linear-programming problem is adjusted so that the same parameter is added to each cost coefficient and each right-hand-side element. By using a sequence of primal and dual simplex transformations, the problem will be optimal for some value of the parameter, with the process continuing until a solution with a zero value of the parameter is found. Simplex method.