LP1

A small company makes only two products with the following two production constraints representing two machines and their maximum availability:
REQUIRED:
If the profit equation is Z = 4X + 2Y, what is the maximum possible profit?

LP2

Golden Hawk Manufacturing seeks to maximize the profits on its three products, for which the following data are available:

REQUIRED:
a. Set up the objective function and constraints for the linear programming problem that will maximize Golden Hawk's profits.
b. Use Lindo to determine the optimal production level for Golden Hawk.

LP3

Jenlock Mill Co. produces two grades of interior plywood from fir and pine lumber. The firm and pine lumber can be sold as saw lumber or used in the plywood.

To produce the plywood, thin layers of wood are peeled from the logs in panels and the panels are glued together to form plywood sheets and then dried. The peeler can peel enough panels to produce 300,000 sheets of plywood in a month. The dryer has a capacity of 1,200,000 minutes for the month. The amount of lumber used and drying time required for each sheet of plywood by grade are shown below:

The only restrictions on the production of fir and pine lumber is the capacity of the mill saws to cut the logs into boards. These saws have a capacity of 500,000 board feet per month regardless of the species.

Jenlock has the following quantities of lumber available for July production: 

The contribution margins for each type of output are:

The demand in July for plywood is expected to be a maximum of 80,000 sheets for Grade A and a maximum of 100,000 sheets for Grade B. There are no demand restrictions on pine and fir.

Jenlock uses a LINDO to determine the production quantities of each product. Formulate the problem and generate a LINDO solution for this problem.