=10-9 Which of the following are NLP problems, and why?

(a) Maximize profit subject to

= + +

≥

≤

≥

3 5 99 10 5

18 1 2 3 1

2 3

X X X X

X X

(b) Maximize cost subject to

= + +

≥

+ ≥

25 30 8 8

12 0 0005 1 2 1 2 1

1 2 X X X X X

X X

. X1 2 − = X 11

(c) Maximize subject to 1 Z Pd P d P X X d d X d

= + +

+ + − =

+

− + +

− +

1 1 2 2 3 2 1 1 2 2 300

− +

− +

− =

+ − =

d X d d 2

1 3 3 200 100

(d) Maximize profit subject to

= +

− ≥

+ ≥

3 4 5 8 3 4 12 1 2 1

2 2

1 2 X X X X X X

(e) Minimize cost subject to

= + +

− ≥

+ ≥

18 5 4 3 8 18 1 2 2 2

1 2 1 2 X X X X X X X Are any of these quadratic programming problems?