Abstract
Consider the Linear Programming (LP) active & effective factor in decision maker & taker process . So that given certain goals , the Significance of (LP) in solving & evaluation the activity during one tools (General Simplex Mehtod)that the solution is Feasible &no optimal then called (Primal Simplex Method) or vice-versa then called(Dual Simplex Method).Same of cases the solution is infeasible & no optimal then using the two methods alternatively once to find the feasible solution and other to find optimal solution.
DOI
10.33095/jeas.v14i52.1428
Subject Area
Statistical
First Page
257
Last Page
274
Recommended Citation
Salih, S. A. (2008). Finding the Feasible and Optimal Solutions for Linear Programming Models Under the Non-Fulfillment of Feasibility and Optimality Conditions. Journal of Economics and Administrative Sciences, 14(52), 257-274. https://doi.org/10.33095/jeas.v14i52.1428
