Abstract
The composite principal-dual simplex method for linear programming solving is proposed. This method in aggregate with principal (primal) and dual methods permits solving any such problem without resort to the artificial unknowns. Problem mathematical model form requirements and conditions to solve the problem by the composite principal-dual simplex method are considered. The algorithm of the composite principal-dual simplex method is represented. The example of corresponding problem solving by the consistent iterations in the simplex tableaus is illustrated.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call