STRIPS planning is a problem of finding of a set of actions that transform given initial state to desired goal situation. It is hard computational problem. In this work an approximation of STRIPS block world planning by linear programming is shown. Additionally two scoring functions have been introduced to estimate quality of the plan. Proposed approach is illustrated by exemplary simulation.