2. Problem 8
A company produces, A and B, which have profits of $9 and $7, respectively. Each unit of product must be processed on two assembly lines, where the required production times are as follows.

hr/Unit
Product Line 1 Line 2
A 12 4
B 4 8
Total hours 60 40

A. Formulate a linear programming model to determine the optimal product mix that will maximize profit.
B. Transform this model into standard form.

3. Problem 9 -
a) Solve problem 8 graphically. List all extreme points (x1, x2, z) and indicate the optimum solution. Identify the amount of unused resources (slack) for each of the extreme points.
b) What would be the effect on the optimal solution if the production time on line 1 was reduced to 40 hours?
c) What would be the effect on the optimal solution if the profit for product B was increased from $7 to $15? How about from $7 to $20?

4. Problem 10 -
For the linear programming model formulated in problem 8 and solved in problem 9:
a) Determine the sensitivity ranges for the objective function coefficients either manually using the graphical solution or using QM for Windows. i.e.: I want you to return the minimum and maximum coefficients (profit margins) for products A and B for which the original optimum solution still applies.
b) Using manual methods, QM for Windows, determine the shadow prices for additional hours of product time on line 1 and line 2.

Please graph the following linearprogramming model-
Max Z = 10x + 6y
45x + 30y < = 180
3c + 8b < = 20
c, b > = 0
Please show graph and all steps in algebra to get the solution.

Consider a cost-benefit-trade-off problem having the following data:
Benefit Contribution
Per Unit of
Each Activity
Minimum
Acceptable
Benefit 1 2 Level
1 5 3 60
2 2 2 30
3 7 9 126
Unit Cost $60 $50
a. Formulate a linearprogramming model for this problem on a spreadsheet.
b. Use Solver to find the op

Claims company processes insurance claims, their perm operators can process 16 claims/day and temp process 12/day and the average for the company is at least 450/day. They want to limit claims error to 25 per day total, and the perm generate .5 errors/day and temp generate 1.4 error per day. The perm operators are paid $465/da

Attached please find Problem B.1 and Problem B.2. Need to solve the linearprogramming problem graphically for each problem.
Textbook info: Operations Management, 8th Edition
Authors: Jay Heizer and Barry Render
Prentice-Hall
Problem B.1
Solve the following linearprogramming problem graphically
Maximize Z = 4X +

1. Your company makes two sizes of globes, large and small. Sales of large globes generate $100.00 profit while small globes generate $50.00 profit. Large globes require 5 hours of kiln time, while small globes require only 1 hour. Management gets a bonus if they sell a lot of the large size globes, and, to increase market share