On solving a linear program with an infeasible optimal basic solution
Abstract
The paper deals with a linear programming (LP) problem in which the primal initial basic feasible solution is optimal but not feasible. To solve such problem we suggest an extension of simplex method. The approach developed can be used to solve integer linear programs.











