This paper presents a structured approach to model logical constraints (expressions that contain propositions and logical operators) in a linear program using binary variables. The approach proceeds in three steps: (1) translating the English sentences into logical compound propositions; (2) transforming these compound propositions in a conjunctive normal form; and (3) creating a linear inequality for each clause of the conjunctive normal form. A detailed example describing the use of this approach is provided.