Scribd Logo
Upload

Welcome to Scribd!

  • 7K views

    Operational Research

    Uploaded by

    Keerthiga Chandrasekar
    A paper mill produces two grades of paper, X and Y, but is limited to producing 400 tons of X and 300 tons of Y per week due to raw material constraints. It takes 0.2 hours to produce 1 ton of X and 0.4 hours to produce 1 ton of Y, with profits of $200 and $500 per ton respectively. The mill has 160 hours of production per week. This problem can be formulated as a linear programming problem to maximize total profit by determining the optimal production mix of X and Y while satisfying the constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Operational Research

    Uploaded by

    Keerthiga Chandrasekar
    7K views2 pages
    A paper mill produces two grades of paper, X and Y, but is limited to producing 400 tons of X and 300 tons of Y per week due to raw material constraints. It takes 0.2 hours to produce 1 ton of X and 0.4 hours to produce 1 ton of Y, with profits of $200 and $500 per ton respectively. The mill has 160 hours of production per week. This problem can be formulated as a linear programming problem to maximize total profit by determining the optimal production mix of X and Y while satisfying the constraints.

    Original Description:

    Original Title

    Operational+Research

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A paper mill produces two grades of paper, X and Y, but is limited to producing 400 tons of X and 300 tons of Y per week due to raw material constraints. It takes 0.2 hours to produce 1 ton of X and 0.4 hours to produce 1 ton of Y, with profits of $200 and $500 per ton respectively. The mill has 160 hours of production per week. This problem can be formulated as a linear programming problem to maximize total profit by determining the optimal production mix of X and Y while satisfying the constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    7K views2 pages

    Operational Research

    Uploaded by

    Keerthiga Chandrasekar
    A paper mill produces two grades of paper, X and Y, but is limited to producing 400 tons of X and 300 tons of Y per week due to raw material constraints. It takes 0.2 hours to produce 1 ton of X and 0.4 hours to produce 1 ton of Y, with profits of $200 and $500 per ton respectively. The mill has 160 hours of production per week. This problem can be formulated as a linear programming problem to maximize total profit by determining the optimal production mix of X and Y while satisfying the constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    Assignment 1 : 1) A paper mill produces two grades of paper namely X and Y.

    Because of raw material restrictions, it cannot produce more than 400 tons of grade X and 300 tons of grade Y in a week. There are 160 production hours in a week. It requires 0.2 and 0.4 hours to produce a ton of products X and Y respectively with corresponding profits of Rs.200 and Rs.500 per ton. Formulate the above as a LPP to maximize profit and find the optimum product mix. Solution Decision variables Let x1 and x2 be the number of units of two grades of paper of X and Y Objective function Since the profit for the two grades of paper X and Yare given, the objective function is to maximize the profit Max(Z) = 200x1 + 500x 2 , Constraints There are 2 constraints one w.r t. to raw material, and the other w.r t .to production hours. The complete LPP is

    Max(Z) = 200x1 + 500x2,


    Subject to

    x1 400 x 2 300 0.2x1 + 0.4x2 160 x1 0, x 2 0,

    Graphical Solution

    You might also like