In a linear programming problem, if the feasible region is closed and bounded then the problem has no solution

1. Leather Limited manufactures two types of belts: the deluxe model and the regular model. Each type requires 1 square meter of leather. A regular belt requires 1 hour of skilled labor, and a deluxe belt requires 2 hours. Each week, 40 square meter of leather and 60 hours of skilled labor are available. Each regular belt contributes USD 3 to profit and each deluxe belt, USD 4. (a) State the problem in a formal Linear Programming equations! (b) Solve the problem using Simplex method! (c) Write down your conclusion from the optimal solution that you have. (d) To improve the total profit of the company, is it better to increase the inventory of leather per week, or to increase the availability of skilled labor per week? Explain!

Determine whether the following linear programming problem is infeasible, unbounded, or has multiple optimal solutions. Draw a graph and explain your conclusion.   Maximize 400x + 500y Subject to      2x + 1y > 60                     -3x + 4y < 90                                                 x, y > 0

Solve the linear programming problem by the simplex method. Minimize 5x + y subject to the constraints shown on the right. The minimum value of Mis (Type integers or fractions.) which is attained for x = and y = x + y2 3 4x ≥ 11 x20, y20