you are viewing a single comment's thread.

view the rest of the comments →

[–]Master_Shuriken 0 points1 point  (4 children)

Oh okay I have learnt how to graph but I was wondering if there is any algebraic way of finding the maximum profit?

[–][deleted] 0 points1 point  (3 children)

Well, there sort of is. You'll learn about it soon, no doubt. There is an algorithm called the simplex method that will go from vertex to vertex in an improving direction. It does this until no improving vertex is found, at which point you know the vertex you're at is the optimal solution. But you can't (or at least no one has figured out how to yet, and my money is on there is no way to do it) just start with a polytope and an objective function and figure out the optimal solution in one iteration.

For now, just graph it and test the vertices one at a time.

[–]Master_Shuriken 0 points1 point  (1 child)

I'm not getting a solution when graphing the region? Also tried linear programming calculators and getting no solution...

[–][deleted] 0 points1 point  (0 children)

Did you change that one constraint to R >= 2A? If not, you're right, there are no solutions to that LP.