References
- G.w.Brown and T.C.Koopmans, Computational suggestions for maximizing a linear function subject to linear inequalities, in T.C.Koopmans, editor, Activity analysis of production and allocation, John Wiley, New York, pp.377–380, 1951.
- H.W.Corley, Jay Rosenberger, Wei-Chang Yeh and T.K.sung, The Cosine simplex algorithm, The international Journal of advanced manufacturing Technology, vol.27, PP.1047–1050, 2006. doi: 10.1007/s00170-004-2278-1
- Danny C Myers, A dual simplex Implementation of a constraint selection algorithm for linear Programming, The Journal of the operational research society, vol.43, PP.177–180, 1992. doi: 10.1057/jors.1992.22
- Danny C Myers and Wei Shih, A Constraint selection technique for a class of linear programs, Operation Research letters, vol.7, PP.191–195, 1998. doi: 10.1016/0167-6377(88)90027-2
- N.Karmarker, A new polynomial-time algorithm for linear programming, Combinatorica, vol. 4, pp.373–395, 1984. doi: 10.1007/BF02579150
- K.G.Murty and Y.Fathi , A feasible direction method for linear programming, Operations Research Letters, vol.3, pp.121–127, 1984. doi: 10.1016/0167-6377(84)90003-8
- S.Paulraj, C.Chellappan and T.R Natesan, A heuristic approach for identification of redundant constraints in linear programming methods, International Journal of computer mathematics, vol.83, PP.675–683, 2006. doi: 10.1080/00207160601014148
- S.Paulraj and P.Sumathi, A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems, Mathematical Problems in Engineering, vol.2010, Article ID 723402, 16pages, 2010,
- N.V.Stojkovic and P.S.Stanimirovic, Two direct methods in linear programming, European Journal of operational research, vol.131, PP.417–439, 2001. doi: 10.1016/S0377-2217(00)00083-7
- P.Sumathi and S.Paulraj, Identification of Redundant Constraints in Large Scale Linear Programming Problems with Minimal Computational Effort, Applied Mathematical Sciences, vol.7, pp. 3963–3974, 2013. doi: 10.12988/ams.2013.36325
- Wei – Chang Yeh and H.W.Corley, A simple direct cosine simplex algorithm, Applied mathematics and computation, vol.214, PP.178–186, 2009. doi: 10.1016/j.amc.2009.03.080
- Y.Yamamota, A new method for solving a Linear programming problem, 49th IEEE conference on decision and control, December 15–17, pp. 3890–3895, 2010.