Linear Programming : Solve by Using a Graphical Method

1. Problem 18:
Solve the following linear programming model using graphical techniques:

Do not submit the graph. In your answer, include each of the corner points and the Z value associated with each of the corner points. Highlight the corner point that optimizes the solution. If there is no feasible solution, then indicate so. If the solution lies along a constraint equation, then indicate the constraint equation and the bounds for x1 and x2.

2. Problem 22:
Solve the following linear programming model by graphical techniques:

Do not submit the graph. In your answer, include each of the corner points and the Z value associated with each of the corner points. Highlight the corner point that optimizes the solution. If there is no feasible solution, then indicate so. If the solution lies along a constraint equation, then indicate the constraint equation and the bounds for x1 and x2.

An LP problem is solved using a graphical method. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

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 +

I need help on how to solve the programming problems below.
1. Solve the following integer programming problem. Provide only the values for A, B, and the Z. You may use any method you choose (graphical, enumeration of vertices, MS Solver, etc.)
Maximize Z = 120A + 80B
Subject to the constraints:
2A + 1B <= 6
7A +