On solving a linear program with an infeasible optimal basic solution

Authors

  • Bector C.R.
  • Gill A.
  • Singh M.

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.

Published

1997-05-09

How to Cite

Bector C.R., Gill A., & Singh M. (1997). On solving a linear program with an infeasible optimal basic solution. Utilitas Mathematica, 51. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/67

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.