1. General structure of Linear programming problem
General structure of Linear programming problem
(Maximize or Minimize) `Z_x=c_1x_1+c_2x_2+c_3x_3+...+c_nx_n` (objective function)
Subject to the constraints
`a_11x_1+a_12x_2+a_13x_3+...+a_(1n)x_n(<=,>=,=)b_1`
`a_21x_1+a_22x_2+a_23x_3+...+a_(2n)x_n(<=,>=,=)b_2`
:
:
`a_(m1)x_1+a_(m2)x_2+a_(m3)x_3+...+a_(mn)x_n(<=,>=,=)b_m` (constraints)
and `x_1,x_2,...,x_n>=0` (non-negative condition)
Here `x_1,x_2,...,x_n` are decision variables
Each constraint may be either
1. `<=` (less than or equal to)
2. `>=` (greater than or equal to)
3. `=` (equal to)
`x_1,x_2,...,x_n>=0` means each `x_i` must be non-negative
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then
|
