Linear and quadratic programming with more than one objective function

A computational procedure is presented for determining optimal solutions to the linear and quadratic programming problem when there is more than one objective function subject to linear constraints. In general a unique solution does not exist and a set of best or efficient points is determined and presented in graphical or tabular form. To solve the mathematical programming problems the simplex method is used for linear objective functions and Wolfe\u27s method is used for quadratic objective functions --Abstract, page ii

I C: Slavery and Human Trafficking

We will be discussing the issue of human trafficking from the 4 different disciplines of 1) Communication Technologies, 2) Business and the Economy, 3) Nursing and Healthcare, and 4) Psychology