A single algorithm is developed to establish minimum resource targets for diverse process integration problems including those of heat/mass exchange, water, hydrogen, carbon emission and material reuse networks. Previous algorithms such as the problem table algorithm for heat exchange networks and the composite table algorithm for resource allocation networks are special cases of the newly proposed unified targeting algorithm (UTA). The conversion of streams to equivalent inlet-outlet (demand-source) pairs is shown to be a key basis for the unified approach. The tabular data from the UTA may be plotted to obtain the grand composite curve (GCC) or the limiting composite curve (LCC). These provide graphical representations of the net load deficit/surplus at various levels for resource targeting and pinch identification. For allocation networks with system loss/gain, the UTA with increasing level sort order yields the Deficit LCC to target the minimum resource, whereas the UTA with decreasing level sort order provides the Surplus LCC to target the minimum waste/excess. A single UTA calculation along with the use of fundamental overall system balance equations is sufficient to establish complete targets for a problem. Six practical case studies from diverse domains are presented to illustrate the detailed steps of the UTA. (C) 2011 The Institution of Chemical Engineers. Published by Elsevier B.V. All rights reserved.