We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We also show that our bound can be better than Lovász theta number and Haemers minimum rank bound.

Battery Energy Storage Systems (BESS) are expected to play an important part in the power system of the future to meet an increasing share of the electricity demand from renewable energy sources. This ...