Maximize z 5 x1 6 x1 x2 2 x2subject to 3 x1 2 x2 ge 6x1


Please explain in detail each of the equations and why it is classified as such:

Classify the following problems as to whether they are pure-integer, mixed-integer, zero-one, goal, or nonlinear programming problems.

Maximize Z = 5 X1 + 6 X1 X2 + 2 X2
Subject to: 3 X1 + 2 X2 ≥ 6
X1 + X2 ≤ 8
X1, X2 ≥ 0


Minimize Z = 8 X1 + 6 X2
Subject to: 4 X1 + 5 X2 ≥ 10
X1 + X2 ≤ 3
X1, X2 ≥ 0
X1, X2 = 0 or 1


Maximize Z = 10 X1 + 5 X2
Subject to: 8 X1 + 10 X2 = 10
4 X1 + 6 X2 ≥ 5
X1, X2 integer


Minimize Z = 8 X12 + 4 X1 X2 + 12 X22
Subject to: 6 X1 + X2 ≥ 50
X1 + X2 ≥ 40

Request for Solution File

Ask an Expert for Answer!!
Mathematics: Maximize z 5 x1 6 x1 x2 2 x2subject to 3 x1 2 x2 ge 6x1
Reference No:- TGS01248391

Expected delivery within 24 Hours