Abstract

We propose a general technique for solving phase-1 Linear Programming (LP) problems with slightly modified phase-2 Linear Programming (LP) methods. Phase-1 LP problems start with a feasible basic solution and the goal is to find an optimum solution; phase-2 LP problems start with an infeasible basic solution and the goal is to find a feasible solution.

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