Chapter Contents |
Previous |
Next |

The ASSIGN Procedure |

The ASSIGN procedure finds the minimum or maximum
cost assignment of *m sink nodes*
to *n source nodes*.
The procedure can handle problems where *m*=,<,>*n*,.

When *n* = *m*, the number of source nodes equals the number of sink nodes and the
procedure solves

subject to: | = 1 for i=1,...,n |

= 1 for j=1,...,m | |

where x=0 or 1 for i=1,...,n and j=1,...,m |

When *n* < *m*, the number of source nodes is less than the number of sink nodes and the
procedure solves

subject to: | = 1 for i=1,...,n |

for j=1,...,m | |

where x=0 or 1 for i=1,...,n and j=1,...,m |

When *n* > *m*, the number of source nodes is greater than the number of sink nodes and the
procedure solves

subject to: | for i=1,...,n |

= 1 for j=1,...,m | |

where x=0 or 1 for i=1,...,n and j=1,...,m |

Chapter Contents |
Previous |
Next |
Top |

Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.