Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    CMPG 312 Semester Test Preparation

    Uploaded by

    Asemahle

    Copyright:

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

    CMPG 312 Semester Test Preparation

    Uploaded by

    Asemahle
    13 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    13 views4 pages

    CMPG 312 Semester Test Preparation

    Uploaded by

    Asemahle

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    CMPG 312 Semester Test Preparation

    In preparation for the Semester Test, make sure you practise the following:

    - Converting constraints to equations


    - Working with slack, surplus and artificial variables
    - Setting up initial simplex tableaus for linear programming problems
    - Interpreting the state of a tableau at any given iteration
    - Solve maximisation and minimisation linear programming problems using simplex
    method
    - Interpret the effect that changes to the objective function and constraints would have on
    a solution solved by using the simplex method
    - Solve linear programming problems using dual formulation
    - Identify special cases from a simplex method tableau at any given point

    Hint: QM for Windows is available for download on eFundi. You are welcome to use it to check
    your answers once you’ve calculated them. If you find other examples that you want to practise
    but can’t find the answers to, this is a good tool to use to validate your answers and see where
    you went wrong. There’s a manual uploaded to eFundi as well with notes in the textbook in
    certain sections as well. DO NOT use it as your primary calculation tool as it will not be
    available to you during tests nor during the exam so you will need to calculate everything
    yourself. I advise that you ONLY use the tool to validate your answers.

    Practise Exercises
    1. Solve the problem below using the simplex method
    Maximise Revenue = 3X1 + 2X2 + X3

    Subject to:
    4X1 + X2 + 3X3 = 30

    2X1 + 3X2 + X3 <= 60

    X1 + 2X2 + 3X3 <= 40

    Where:

    X1, X2, X3 >= 0

    Hint: Use slack and artificial variables. Read more about when slack, surplus and artificial variables
    are used.
    2. Solve the problem below using the simplex method

    Maximise Investment = X1 - X2 + X3

    Subject to:

    2X1 + X2 - 3X3 <= 40 (first constraint)

    X1 + X3 <= 25 (second constraint)

    2X2 + 3X3 <= 32 (third constraint)

    Where:

    X1, X2, X3 >= 0

    Hint: Use slack and artificial variables. Read more about when slack, surplus and artificial variables
    are used.

    Based on the above, evaluate the effect of the following:

    - A change of signs in the second constraint. New constraint: X1 + X3 >= 25, replacing the second
    constraint.
    - A change in the first constraint from 40 to 45
    - A change in the second constraint from 25 to 20
    - A change in the third constraint from 2X2 + 3X3 to 3X2 + 2X3

    3. Solve the problem below using the simplex method

    Minimise Transportation Cost = 3X1 + 2X2

    Subject to:

    2X1 + X2 >= 6
    X1 + X2 >= 4

    Where:

    X1, X2 >= 0
    4. Solve the problem below using the simplex method

    Minimise Advertising Cost = 2X1 + 10X2 + 8X3

    Subject to:
    X1 + X2 + X3 >= 6 (first constraint)

    X2 + 2X3 >= 8 (second constraint)

    -X1 + 2X2 + 2X3 >= 4 (third constraint)

    Where:

    X1, X2, X3 >= 0

    Based on the above, evaluate the effect of the following:

    - A change of signs in the first constraint. New constraint: X1 + X2 + X3 <= 6, replacing the first
    constraint.
    - A change in the first constraint from 6 to 8
    - A change in the second constraint from 8 to 6
    - A change in the third constraint from -X1 + 2X2 + 2X3 to 2X1 + 2X2 - 1X3

    5. Solve the problem below using the simplex method


    Minimising cost = R0.80 X1 + R0.40 X2 + R1.20 X3 - R0.10 X4

    Subject to:
    X1 + 2 X2 + X3 + 5 X4  150
    X2 - 4 X3 + 8 X4 = 70
    6 X1 + 7 X2 + 2 X3 - X4  120
    X1, X2, X3, X4  0

    6. Solve the problem below using the dual formulation simplex method

    Minimise Cost = 3x + 9y

    Subject to:
    2x + y >= 8
    x + 2y >= 8
    x, y>= 0

    Hint: Focus on being able to transpose minimisation problems (here’s a good guide on how
    to do that: https://www.youtube.com/watch?v=8_D3gkrgeK8)
    7. Solve the problem below using the dual formulation simplex method

    Minimise Cost = 2x1 + 3x2 + 4x3 + 5x4

    Subject to:

    x1 - x2 + x3 - x4 >= 10
    x1 - 2x2 + 3x3 - 4x4 >= 6
    3x1 - 4x2 + 5x3 - 6x4 >= 15
    x1, x2, x3, x4 >= 0

    8. Solve the problem below using the dual formulation simplex method

    Minimise Cost = 2b + 3c + 4d + 5e

    Subject to:

    1b – 1c + 1d – 1e >= 10
    1b – 2c + 3d – 4e >= 6
    3b – 4c + 5d – 6e >= 15
    b, c, d, e >= 0

    You might also like