Option A. Both statements are true. Reasoning: By definition, a Linear Programming Problem (LPP) has a linear objective function, for example max‌z=c1x1+c2x2+⋯+cnxn. The restrictions on the variables take the form of linear inequalities (or equalities), such as ai1x1+ai2x2+⋯+ainxn≤bi, and these are called constraints.