Scribd Logo
Upload

Welcome to Scribd!

  • 48 views

    BD20022 Opr

    Uploaded by

    Deep
    The document presents data on 5 machines and their performance on 5 tasks, including the processing time for each task and a binary assignment of whether the machine can perform the task. It shows that Machine E is best for Task 5 while Machines A, B, C, and E can perform Task 1, and provides performance data that could be used to determine the best machine-task assignments.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd

    BD20022 Opr

    Uploaded by

    Deep
    48 views12 pages
    The document presents data on 5 machines and their performance on 5 tasks, including the processing time for each task and a binary assignment of whether the machine can perform the task. It shows that Machine E is best for Task 5 while Machines A, B, C, and E can perform Task 1, and provides performance data that could be used to determine the best machine-task assignments.

    Original Description:

    OPR

    Original Title

    BD20022_OPR

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document presents data on 5 machines and their performance on 5 tasks, including the processing time for each task and a binary assignment of whether the machine can perform the task. It shows that Machine E is best for Task 5 while Machines A, B, C, and E can perform Task 1, and provides performance data that could be used to determine the best machine-task assignments.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    48 views12 pages

    BD20022 Opr

    Uploaded by

    Deep
    The document presents data on 5 machines and their performance on 5 tasks, including the processing time for each task and a binary assignment of whether the machine can perform the task. It shows that Machine E is best for Task 5 while Machines A, B, C, and E can perform Task 1, and provides performance data that could be used to determine the best machine-task assignments.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    of 12

    x y

    3 8
    4.8 3.2 40
    RHS LHS
    1 1 8 8
    2 -3 0 0
    1 2 42 11.2
    Coeff x Coeff y RHS Cuts x Cuts y
    Constraint1 5 0 25 5 0
    Constraint2 2 -5 2 1 NA
    Constraint3 3 2 20 6.6666667 10
    Objective 8 3 0

    -15 -10
    20

    15

    10

    0
    -10 -5 0 5 10 15

    -5

    -10

    -15
    Constraint 1
    Constraint 2
    Constraint 3
    Objective
    Constraint 1
    Constraint 2
    10 15
    Constraint 3
    Objective
    4 3 2 1
    7 4 100 2 100 900
    6 1 7 100 100 800
    5 100 3 100 100 500
    4 100 100 1 100 2200
    3 4 100 100 2 2200
    1 100 100 3 100 2200
    2200 2200 1200 3200

    4 3 2 1
    7 0 900 0 0 900
    6 0 0 800 0 800
    5 500 0 0 0 500
    4 2200 0 0 0 2200
    3 0 2200 0 0 2200
    1 0 0 0 2200 2200
    2200 2200 1200 3200

    Objective 880000
    Notations: Number of students in courses

    Books required (per student)


    Technical partner spending (per student, in Rupees)
    Number of examinations required (per student)
    Course profit for institute (per student, in Rupees)

    Max
    Objective
    x1 x2 x3 x4
    0 1600 0 0

    LHS RHS
    8 5 7 6 8000 8000
    2500 3000 4000 5000 4800000 1590000
    15 10 20 20 16000 20000
    6000 7500 10000 3500

    12000000
    less than
    more than
    less than
    LESS THAN
    Task 1 Task 2 Task 3
    Machine A 100 100000 30
    Machine B 50 100 150
    Machine C 150 212 140
    Machine D 200 150 130
    Machine E 70 150 100
    1 1 1

    0 0 1
    1 1 0
    0 0 0
    0 0 0
    0 0 0
    1 1 1
    Task 4 Task 5
    150 90 2
    122 40 2
    70 150 2
    110 80 2
    10000000 30 2
    1 1

    0 0 1
    0 0 2
    1 0 1
    0 0 0
    0 1 1
    1 1 280

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy