Scribd Logo
Upload

Welcome to Scribd!

  • 733 Problems

    Uploaded by

    AMan
    13 views1 page
    This document outlines a product mix problem with fixed costs for 3 products (F1, F2, F3) where the objective is to maximize variable profit subject to capacity and demand constraints. The variable profits, fixed costs, capacity requirements, and demand for each product are provided to determine the optimal production quantity of each product.

    Original Description:

    Original Title

    733_Problems.xlsx

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines a product mix problem with fixed costs for 3 products (F1, F2, F3) where the objective is to maximize variable profit subject to capacity and demand constraints. The variable profits, fixed costs, capacity requirements, and demand for each product are provided to determine the optimal production quantity of each product.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    13 views1 page

    733 Problems

    Uploaded by

    AMan
    This document outlines a product mix problem with fixed costs for 3 products (F1, F2, F3) where the objective is to maximize variable profit subject to capacity and demand constraints. The variable profits, fixed costs, capacity requirements, and demand for each product are provided to determine the optimal production quantity of each product.

    Copyright:

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

    Product Mix with Fixed Costs

    Decisions
    F1 F2 F3
    300 200 0 K-units
    1 1 0 indicator
    Objective
    Variable profit 1.20 1.80 2.20
    Fixed cost 60 200 100 460 K$
    Constraints
    A 3 4 8 1700 <= 2000
    B 3 5 6 1900 <= 2000
    C 2 3 9 1200 <= 2000

    demand 300 200 50 K-units


    linking 0 0 0

    You might also like