If the feasible region of a linear programming is bounded,then it is always a _______

Who invented Linear programming problem?

A firm produces two different products A and B . Each product has to undergo three operations before it takes the final shape. The profit per unit and time required per unit of each product in each operation is tabulated below: To formulate a linear programming problem write Packing constraints.

A rectangle with one side lying along the x-axis is to be inscribed in the closed region of the xy plane bounded by the lines y = 0, y = 3x, and y = 30 - 2x. The largest area of such a rectangle is

A firm produces two different products A and B . Each product has to undergo three operations before it takes the final shape. The profit per unit and time required per unit of each product in each operation is tabulated below: To formulate a linear programming problem write Objective function

A firm produces two different products A and B . Each product has to undergo three operations before it takes the final shape. The profit per unit and time required per unit of each product in each operation is tabulated below: To formulate a linear programming problem write Cutting constraints.

Find the area of the region bounded by the y^2=4ax and x^2=4ay , a>0

Find the area of the region bounded by the curve y=x^2 and the line y=4

The graph of linear programing problem is given below.The shaded region is the feasible region.The objective function is Z=px+qy What are the co ordinates of the corners of the feasible region.