# Complexity of linear programming

I have a basic question, if I can model a problem $$(P)$$ by a linear program, can we say that $$(P)$$ is polynomial?

Linear programs can be solved using simplex, and it was proved that simplex run in exponential time for some instances, so why some references assume that linear programming is polynomial?