The　aim　of　this　note　is　to　point　out　and　correct　some　vital　mistakes　in　the　paper　by　P　K　Nayak　and　M　Pal,　＂Linear　programming　technique　to　solve　two　person　matrix　(games　with　interval　pay-offs).　Asia-Pacific　Journal　of　Operational　Research,　26(2),　285-305＂.　Lots　of　serious　mistakes　on　the　definitions,　conclusions,　models,　methods,　proofs　and　computing　results　have　been　corrected　and　modified　in　this　note.　We　also　indicate　inappropriate　formulations　regarding　their　proposed　linear　programming　models　for　solving　generic　matrix　games　with　interval　pay-offs　and　suggest　a　pair　of　linear　programming　models　with　any　minimal　acceptance　degree　of　the　interval　inequality　constraints　which　may　be　allowed　to　violate.　The　lexicographic　method　is　suggested　so　that　a　rational　and　credible　solution　of　the　generic　matrix　game　with　interval　pay-offs　can　be　achieved.