Linear Programming

State the methods to solve linear programming problem.

• Graphical Method

• Simplex Method

• Table Method

• Substitution Method

What are the main component of linear programming problem?

• Decision Variables

• Objective Function

• Constraints

• Optimal Solution

_____________ are the entities whose value are to be determined from the solution of linear programming.

• Opportunity costs

• Objective function

• Constraints

• Decision variables

_________ are the restrictions or limitation imposed on the linear programming problem.

• Cost

• Variables

• Constraints

• Profit

The type of constraints which specifies maximum capacity of a resource is _______________ constraints.

• Less than

• Less than or equal

• Greater than

• Greater than or equal

" Abu's monthly (s) salary is at least RM2000". Convert the sentences given into inequality.

• $s\ >\ 2000$
  

• $s<2000$

• $s\ge2000$

• $s\le2000$

" A contractor can build at most 500 of an apartment,(x) and flat,(y) houses" . Convert the sentence given into inequality.

• $x+y\le500$

• $x+y\ge500$

• $x+y<500$

• $x+y>500$

In case of an ______________ constraints, the graph line is a solid straight line.

• more than

• less than

• greater than

• equal to

If the given inequality is greater than or greater than or equal, the region _______________ the straight line ax+by+c=0 has to be shaded.

• below

• above

To find the optimal solution for maximum cases, all entries in the objective row of the final tableau are ___________

• positive

• negative