Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Exercise On Simplex Maximization

    Uploaded by

    BEA CATANEO
    This document contains two problems to solve using the simplex maximization method. The first problem involves maximizing a linear function subject to three inequality constraints and non-negativity constraints. The second problem involves maximizing profit for a company that produces tables, chairs, and lamps using three machine centers with time constraints, where each product generates a different profit amount. The goal is to determine the number of each product type to produce to maximize total profit.

    Copyright:

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

    You might also like

    Exercise On Simplex Maximization

    Uploaded by

    BEA CATANEO
    3 views1 page
    This document contains two problems to solve using the simplex maximization method. The first problem involves maximizing a linear function subject to three inequality constraints and non-negativity constraints. The second problem involves maximizing profit for a company that produces tables, chairs, and lamps using three machine centers with time constraints, where each product generates a different profit amount. The goal is to determine the number of each product type to produce to maximize total profit.

    Original Description:

    simplex maximization exercise problem

    Original Title

    Exercise-on-Simplex-Maximization

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains two problems to solve using the simplex maximization method. The first problem involves maximizing a linear function subject to three inequality constraints and non-negativity constraints. The second problem involves maximizing profit for a company that produces tables, chairs, and lamps using three machine centers with time constraints, where each product generates a different profit amount. The goal is to determine the number of each product type to produce to maximize total profit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    3 views1 page

    Exercise On Simplex Maximization

    Uploaded by

    BEA CATANEO
    This document contains two problems to solve using the simplex maximization method. The first problem involves maximizing a linear function subject to three inequality constraints and non-negativity constraints. The second problem involves maximizing profit for a company that produces tables, chairs, and lamps using three machine centers with time constraints, where each product generates a different profit amount. The goal is to determine the number of each product type to produce to maximize total profit.

    Copyright:

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

    EXERCISE ON SIMPLEX MAXIMIZATION

    Solve the following problems by the Simplex Maximization Method.

    1. Max: P = 2x1 + 4x2 +3x3


    Subject to: 3x1 + 4x2 + 2x3 ≤ 60
    2x1 + x2 + 2x3 ≤ 40
    x1 + 3x2 + 2x3 ≤ 80
    x1 , x2 , x3 ≥ 0

    2. ABC Company produces tables, chairs and lamps. Each table requires 6 minutes in machine
    center A, 5 minutes in machine center B, and 8 minutes in machine center C. Each chair
    produced requires 5, 4 and 5 minutes in machine centers A, B and C respectively. Likewise, each
    lamp produced requires 6, 4 and 6 minutes in machine centers A, B and C respectively. The
    company has a daily availability of 2400 minutes in machine center A, 2000 minutes in machine
    center B and 3000 minutes in machine center C. Each table gives P450 profit, a chair gives P350
    and a lamp gives P200. Using simplex method, find the number of each type of products to
    produce in order to maximize the company’s profit.

    You might also like