Can I read An artificial-free simplex-type algorithm for general LP models on EtoBox?

An artificial-free simplex-type algorithm for general LP models by H. Arsham is a Mathematics article available to read on EtoBox.

What is An artificial-free simplex-type algorithm for general LP models about?

The simplex algorithm requires additional variables (artificial variables) for solving linear programs which lack feasibility at the origin point. Some students, however, particularly nonmathematics majors, have difficulty understanding the intuitive notion of artificial variables. A new general purpose solution algorithm obviates the use of artificial variables. The algorithm consists of two phases. Phase 1 searches for a feasible segment of the boundary hyper-plane (a fact of feasible region or an intersection of several faces) by using rules similar to the ordinary simplex Each successive iteration augments the basic variable set, BVS, by including another hyper-plane, until the BVS is full, which specifies a feasible vertex. In this phase, movements are on faces 0: the feasible region rather than from a vertex to a vertex. This phase terminates successfully (01 indicates the infeasibility of the problem) with a finite number of iterations, which is at most equal to the number of constraints. The second phase uses exactly the ordinary simplex rules (if needed) to achieve optimality. This unification with the simplex method is achieved by augmenting the feasible BVS, which is alw

Who reads An artificial-free simplex-type algorithm for general LP models?

Author

H. Arsham

Publisher

Elsevier Science; Elsevier ; Pergamon Press Ltd.; Elsevier BV (ISSN 0895-7177)

Published

1997

Language

EN

Field

Mathematics (Physical Sciences)