How to solve a number of math equations in Java to maximize profit?

Asked Jul 22 '20 at 17:03

Active Jul 22 '20 at 17:15

Viewed 82 times

I am working on a math problem with a bunch of equation like the ones below

x1 and x2 are variables

Constraints

x1 +  x2  <= z
ax1 + bx2 < p;
cx1 + dx2 < q;

I need to maximise profit, which looks like this in terms of equation

 maximize ex1+fx2

Does anybody how to solve these equations to maximise profit?

edited Jul 22 '20 at 17:15

asked Jul 22 '20 at 17:03

Sahil

Draw a set of axes representing $(x_1,x_2)$, then sketch the constraint lines and shade the feasible region, the maximum of the objective function will occur at one of the corner points. – Vishu Jul 22 '20 at 17:07
@Tavish Could you please explain why that would be the case? – Sahil Jul 22 '20 at 17:09
See https://math.stackexchange.com/questions/896388/why-maximum-minimum-of-linear-programming-occurs-at-a-vertex – Vishu Jul 22 '20 at 17:15

0 Answers0