Linear Programm...

Minimise $$Z=\sum _{ j=1 }^{ n }{ \sum _{ i=1 }^{ m }{ { c }_{ ij }.{ x }_{ ij } }  } $$
Subject to $$\sum _{ i=1 }^{ m }{ { x }_{ ij } } ={ b }_{ j },j=1,2,......n$$
$$\sum _{ j=1 }^{ n }{ { x }_{ ij } } ={ b }_{ j },j=1,2,......,m$$ is a LPP with number of constraints

The solution of the set of constraints of a linear programming problem is a convex (open or closed) is called ______ region.

Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that

If a = b then ax = ...........

The bar graph shows the grades obtained by a group of pupils in a test.
If grade C is the passing mark, how many pupils passed the test?

An iso-profit line represents

In linear programming, lack of points for a solution set is said to

If  x + y = 3 and xy = 2, then the value of $$\displaystyle x^{3}-y^{3}$$ is equal to 

If the constraints in linear programming problem are changed

The bar graph shows the number of cakes sold at a shop in four days.
What is the difference in number of cakes between the highest and the lowest daily sale?