Scribd Logo
Upload

Welcome to Scribd!

  • Problem Solution or 4

    Uploaded by

    Saurabh Kumar Jaiswal
    4 views1 page
    This document describes an integer linear programming problem to optimally assign teams to projects to minimize total cost. It defines 16 binary decision variables to represent each possible team-project assignment. It includes constraints that each team can only be assigned to one project, and each project can only be assigned to one team. The objective is to minimize the total cost of assignments across all team-project combinations.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes an integer linear programming problem to optimally assign teams to projects to minimize total cost. It defines 16 binary decision variables to represent each possible team-project assignment. It includes constraints that each team can only be assigned to one project, and each project can only be assigned to one team. The objective is to minimize the total cost of assignments across all team-project combinations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Problem Solution or 4

    Uploaded by

    Saurabh Kumar Jaiswal
    This document describes an integer linear programming problem to optimally assign teams to projects to minimize total cost. It defines 16 binary decision variables to represent each possible team-project assignment. It includes constraints that each team can only be assigned to one project, and each project can only be assigned to one team. The objective is to minimize the total cost of assignments across all team-project combinations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Cost Project

    1 2 3 4 1 2 3 4 ROW SUM
    1 9 4 5 8 1 0 0 1 0 1
    Team 2 6 9 8 7 2 1 0 0 0 1
    3 10 3 5 4 3 0 1 0 0 1
    4 9 13 12 7 4 0 0 0 1 1
    COL.SUM 1 1 1 1

    1 2 3 4
    1 X11 X12 X13 X14 Z 21
    2
    3
    4 X44 Team 1-> Project 3
    Team 2 -> Project 1
    X11 - If Team 1 is assigned to Project 1, this variable will take a value of 1; otherwise, 0 Team 3-> Project 2
    Team 4-> Project 4
    Decision variables 16 binary variables

    Constraints

    1. Every team should work on only ONE project

    X11+X12+X13+X14=1 X11=1
    X21+X22+X23+X24=1 X21=1
    X31+X32+X33+X34=1 X31=1
    X41+X42+X43+X44=1 X41=1

    2. Every project should be assigned to only ONE team

    column wise sum=1 Objective function: Minimize the TOTAL COST OF ASSIGNMENT

    x11+X21+X31+X41=1 Min Z = 9X11+4X12+…..+7X44


    X12+X22+X32+X42=1
    .
    .
    X14+X24+X34+X44=1

    You might also like