An artificial-free simplex-type algorithm for general LP models

DOI10.1016/S0895-7177(96)00188-4zbMath0881.90093OpenAlexW2071366087MaRDI QIDQ1362223

Hossein Arsham

Publication date: 3 August 1997

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(96)00188-4

zbMATH Keywords

dual problemartificial variablebasic variable setgeneral purpose solution algorithminitialization of simplex method rules

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ A computationally stable solution algorithm for linear programs ⋮ Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham ⋮ Artificial-free simplex algorithm based on the non-acute constraint relaxation

Cites Work

• Making progress during a stall in the simplex algorithm
• A linear symbolic-based approach to matrix inversion
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Sensible Rules for Remembering Duals—the S-O-B Method
• A comparison of the primal‐simplex and complementary pivot methods for linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An artificial-free simplex-type algorithm for general LP models