# How to convert a minimization problem to maximization problem and vice versa

So i have this LP problem that can be transformed into Now thanks to previous users I know that to transform min to max all i need to to is multiply the objective function by -1

But say i want to transform a maximization function to a minimization function?

1) is there any use in doing so ?

2) if there is any use, what would the relationship be?

Please explain in the simplest way possible; i am new to this topic. Thanks!

• You have $\min \ z=-x_1$. Now you want to apply the simplex algorithm. This algorithm is basically for maximization problems. To apply this algorithm for minimization problems you maximize $-z=x_1$. Jun 26 '19 at 14:39
• Any reply, Sara? Jun 26 '19 at 14:53
• Thanks! So this works only when transforming min to max. If i have a max function i will just leave it as it is for simplicity? Jun 26 '19 at 15:00
• May you help me on my other question too that i just posted ? Its about finding optimal values of this same optimization problem. Jun 26 '19 at 15:01
• Yes, you are right. At the other question I would use the simplex algorithm as well. Jun 26 '19 at 15:02