Scribd Logo
Upload

Welcome to Scribd!

  • Mossaic Tiles, LTD.: Presented By, Amal Dev V. (66) Manas Tripathi (95) Tarun Kumar

    Uploaded by

    Amal Dev
    40 views14 pages
    This document presents an optimization problem to maximize profit for a tiles production company by determining the optimal number of batches of different tile types to produce given constraints. It defines decision variables x1 and x2 representing the number of batches of large single-colored tiles and small patterned tiles. The objective is to maximize total profit defined as $190x1 + $240x2. Constraints include limits on molding, baking, glazing/coloring time and clay quantity. The optimal solution is found to be x1 = 136.36 batches of large tiles and x2 = 76.36 batches of small tiles, yielding maximum profit of $44,234.80.

    Original Description:

    graphical solution

    Original Title

    dmm

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document presents an optimization problem to maximize profit for a tiles production company by determining the optimal number of batches of different tile types to produce given constraints. It defines decision variables x1 and x2 representing the number of batches of large single-colored tiles and small patterned tiles. The objective is to maximize total profit defined as $190x1 + $240x2. Constraints include limits on molding, baking, glazing/coloring time and clay quantity. The optimal solution is found to be x1 = 136.36 batches of large tiles and x2 = 76.36 batches of small tiles, yielding maximum profit of $44,234.80.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    40 views14 pages

    Mossaic Tiles, LTD.: Presented By, Amal Dev V. (66) Manas Tripathi (95) Tarun Kumar

    Uploaded by

    Amal Dev
    This document presents an optimization problem to maximize profit for a tiles production company by determining the optimal number of batches of different tile types to produce given constraints. It defines decision variables x1 and x2 representing the number of batches of large single-colored tiles and small patterned tiles. The objective is to maximize total profit defined as $190x1 + $240x2. Constraints include limits on molding, baking, glazing/coloring time and clay quantity. The optimal solution is found to be x1 = 136.36 batches of large tiles and x2 = 76.36 batches of small tiles, yielding maximum profit of $44,234.80.

    Copyright:

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

    MOSSAIC TILES, LTD.

    Presented by,
    Amal Dev V. (66)
    Manas Tripathi (95)
    Tarun Kumar (120)
    STEPS INVOLVED IN TILES PREPARATION

    CLAY

    DERIVATIVE

    COLORING/ PATTERNING
    MOLDING BAKING & GLAZING
    DETAILS LARGE TILES SMALL TILES

    Time required for molding a batch of 100 18 min = 0.3 hr 15 min = 0.25 hr

    Available time for molding in a week = 60 hrs

    Time required for baking a batch of 100 0.27 hr 0.58 hr

    Available time for baking in a week = 105 hrs

    Time required for coloring/patterning/glazing a


    0.16 hr 0.2 hr
    batch of 100

    Available time for coloring/patterning/glazing in a week = 40 hrs

    Clay derivative required to produce a batch of 100 32.8 pounds 20 pounds

    Maximum clay derivative available in a week = 6000 pounds

    Profit earns from a batch of 100 $190 $240


    DEFINING THE VARIABLES
    Let x1 be the no: of batches of large, single
    colored tiles produced (1 batch = 100 tiles)

    Let x2 be the no: of batches of small, patterned


    tiles produced (1 batch = 100 tiles)
    OBJECTIVE FUNCTION
    To maximize the profit:
    Max Z= $190x1+$240x2
    CONSTRAINTS
    0.3x1+0.25x2 <= 60 (Molding time constraint)

    0.27x1+0.58x2 <= 105 (Baking time constraint)

    0.16x1+0.2x2 <= 40 (Glazing, coloring and


    patterning time constraint)

    32.8x1+20x2 <= 6000 (Clay quantity constraint)

    x1,x2 >= 0 (Non-negative constraint)


    SOLUTION
    350

    300

    250240
    0.3x1+0.25x2=60

    200

    molding time constraint


    150

    100

    50

    0
    0 50 100 150 200 250 300 350 400 450 500
    350

    300

    250240

    200
    181.03
    molding time constraint
    Baking time constraint
    150
    0.27x1+0.58x2=105

    100

    50

    388.88
    0
    0 50 100 150 200 250 300 350 400 450 500
    350

    300

    250240

    200
    181.034 molding time constraint
    Baking time constraint
    150 Glazing time constraint

    100

    50
    0.16x1+0.2x2=40
    250 388.88
    0
    0 50 100 150 200 250 300 350 400 450 500
    350

    300

    250240

    200 molding time constraint


    181.034
    Baking time constraint
    Glazing time constraint
    150
    clay quantity constraints

    100

    50
    32.8x1+20x2=6000
    182.92 250 388.88
    0
    0 50 100 150 200 250 300 350 400 450 500
    350

    300

    250240

    200 molding time constraint


    0,181.034
    Baking time constraint
    Glazing time constraint
    150 56.7,
    154.63 clay quantity constraints
    100, 120

    100
    136.36, 76.36

    50

    182.92,0 250 388.88


    0
    0 50 100 150 200 250 300 350 400 450 500
    PUTTING VALUES FOR x1 AND x2 TO MAXIMIZE PROFIT, Z

    x1 x2 Z=
    190X1+240X2
    0 0 0
    0 181.03 43447.2
    56.7 154.63 47884.2
    100 120 47800
    136.36 76.36 44234.8
    182.92 0 34754.8
    THANK YOU

    You might also like