What is maximization in linear programming?

Open in App

Solution

Maximization in linear programming
Linear programming is a method of optimizing operations with some constraints.
Maximization linear programming problems are used to obtain the highest possible value of the function.
It is widely used for profit maximization.
A minimization problem can be converted into a maximization problem.
For example:
$m i n Z = 2 x_{1} - 4 x_{2} - 5 x_{3}$ can be written as $m a x Z^{*} = - 2 x_{1} + 4 x_{2} + 5 x_{3}$

Suggest Corrections

Similar questions

z = 60 x + 15 y

x + y \leq 50

3 x + y \leq 90

x, y \geq 0

z = 3 x + 4 y

x + y \leq 4, x \geq 0, y \geq 0

3 x + 5 y \leq 5; 5 x + 2 y \leq 10; x \geq 0, y \geq 0

Z = 5 x + 3 y

Join BYJU'S Learning Program