Mathematics Solving Linear Programming using QM for windows

Formulate a linear programming model for the below set of problems. For those problems, solve the linear programming model by using the computer. You can use either QM for Windows or Solver (in Excel) to solve these problems.
If using QM for Windows, you can capture the results and a graph in one of two ways:
? By doing a "Print Screen," you capture the screen image. You can now copy directly to Word (or to Paint, and then to Word).
? Or you can save data from QM for Windows as an HTML file. You can only save data one window at a time. Highlight the QM for Windows output window you want to save and select Save As HTML. You can then edit the HTML file in Word to your liking, or you can copy it directly to Word.
? If you use QM for Windows, please include the results screen and the Graph in the Word document you create. Follow the format of the examples that were posted in the Doc Sharing tab. Include the model formulation or a window showing the constraints. Save the resulting file as a Word file.
If using Solver, please submit the Excel file (include the model formulation on the worksheet). If using an Excel document, put one problem per worksheet, label all worksheets and put all problems in one file.

Problem 1
A company produces two products that are processed on two assembly lines. Assembly line 1 has 100 available hours, and assembly line 2 has 42 available hours. Each product requires ...
Problem 2
A company makes fertilizer using two chemicals that provide nitrogen, phosphate and potassium. A pound of ingredient 1 contributes 10 ounces of nitrogen and 6 ounces of phosphate, while a pound of ingredient ...
Problem 3
A drug company produces drug from two ingredients. Each ingredient contains the same three antibiotics, in different proportions. One gram of ingredient 1 contributes 3 units and 1 gram of ingredient 2 contributes ...
Problem 4
A clothier makes coats and slacks. The two resources required are wool cloth and labor. The clothier has 150 square yards of wool and 200 hours of labor available. Each cost requires 3 square yards of wool ...
I am looking for solutions for these four problems using QM for windows or Solver in Excel. If I can get a detailed solution with explantion I will be grateful.

Please make sure all work is shown to include the tables so that I can do a comparison to make sure the way I think it should be done is being done. While QM forwindows can be used to solve this, I would appreciate the other way shown as well so that I can understand what is going on verse having a program do the work for me.

1. Find the complete (including values for slack variables) optimal solution to this linear programming problem using. graphical method
Min 5X + 6Y
s.t. 3X + Y > 15
X + 2Y > 12
3X + 2Y > 24
X , Y > 0
2. Find the complete (including values for slack variables) optimal solution

1. Solve the linearprogramming problem:
minimize z = x + y
subject to
x + 2y =< 40,
2x + y =<40,
x + y =<10,
x >= 0, y >=0
The corner points are: (0, 10), (0, 20), (40/3, 40/3) (20, 0), (10, 0).

I'm looking for help for the following LP problem to be done in Excel, using level curves or the corner-point method.
To shade partial cells in Excel, the trick is to copy the sketch from Excel into Windows "Paint" program and do the shading there using the brush tools. Then you can copy and paste the sketch back into Excel a

Which of the following could be a linearprogramming objective function?
Z = 1A + 2B / C + 3D
Z = 1A + 2BC + 3D
Z = 1A + 2B + 3C + 4D
Z = 1A + 2B2 + 3D
all of the above.

Consider the following linear programming problem.
MIN Z = 10x1 + 20x2
Subject to: x1 + x2 >= 12
2x1 + 5x2 >= 40
x1, x2 >= 0
What is minimum cost Z=??
Put your answer in the xxx.x (to one decimal place)

Given the following linearprogramming problem:
Min Z = 2x + 8y
Subject to (1) 8x + 4y 64
(2) 2x + 4y 32
(3) y 2
At the optimal solution the minimum cost is:
a. $30
b. $40
c. $50
d. $52
d. $53.33

MIN z= 5x1 +2x2
st 2x1 +5x2>or equal to 10
4x1-x2>or equal to 12
x1 + x2 > or equal to 4
x1, x2 > or equal to 0
A Solve graphically for the optimal solution.
B How does one know that although x1=5, x2=3 is a feasible solution for the constraints, it will never be the optimal solution no matter what o

The three princes of Serendipity went on a little trip. They could not carry too much weight. More than 300 pounds made them hesitate. They planned to the ounce. When they returned to Ceylon, they discovered that the supplies were just about gone when ....
Request results be available utilizing POM-QM software forwindows. S