Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 67 views

    MAN 327 2.0 Micro-Computers & Their Applications Group Assignment

    Uploaded by

    Milan Lahiru
    The document describes a linear programming problem to maximize profit for a manufacturer making desks and tables. The manufacturer can assemble, buff, and crate a limited number of hours per week. The objective is to maximize profit, which is $3 per desk and $4 per table. The solver was used in Excel to find the optimal solution of making 4 desks and 6 tables for a maximum profit of $36.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    MAN 327 2.0 Micro-Computers & Their Applications Group Assignment

    Uploaded by

    Milan Lahiru
    67 views7 pages
    The document describes a linear programming problem to maximize profit for a manufacturer making desks and tables. The manufacturer can assemble, buff, and crate a limited number of hours per week. The objective is to maximize profit, which is $3 per desk and $4 per table. The solver was used in Excel to find the optimal solution of making 4 desks and 6 tables for a maximum profit of $36.

    Original Title

    Assignment

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a linear programming problem to maximize profit for a manufacturer making desks and tables. The manufacturer can assemble, buff, and crate a limited number of hours per week. The objective is to maximize profit, which is $3 per desk and $4 per table. The solver was used in Excel to find the optimal solution of making 4 desks and 6 tables for a maximum profit of $36.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    67 views7 pages

    MAN 327 2.0 Micro-Computers & Their Applications Group Assignment

    Uploaded by

    Milan Lahiru
    The document describes a linear programming problem to maximize profit for a manufacturer making desks and tables. The manufacturer can assemble, buff, and crate a limited number of hours per week. The objective is to maximize profit, which is $3 per desk and $4 per table. The solver was used in Excel to find the optimal solution of making 4 desks and 6 tables for a maximum profit of $36.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 7

    MAN 327 2.

    0 Micro-computers & their Applications Group Assignment


    Solving a Linear Programming Model Problem using Excel-Solver

    Group Members
    AS2009426 M.D.M. LAHIRU AS2009351 M.M.M. DILUSHAN AS2009449 B.A.E.H. MENDIS

    Manufacturing Linear Programming Model

    Problem A manufacturer makes wooden desks (x) and tables (y). Each desk requires 2.5 hours to assemble, 3 hours for buffing, and 1 hour to crate. Each table requires 1 hour to assemble, 3 hours to buff, and 2 hours to crate. The firm can do only up to 20 hours of assembling, 30 hours of buffing, and 16 hours of crating per week.

    Profit is $3 per desk and $4 per table. Maximize the profit.

    Objective function Profit = 3x + 4y x is the number of desks. y is the number of tables.

    Constraints Assembling Buffing Crating 2.5x + y 3x + 3y x + 2y 20 30 16

    Non-negativity x y 0 0

    Entering data to the Excel Sheet

    Solving the Problem using Solver

    The Solution

    Microsoft Excel 14.0 Answer Report Worksheet: [Book1]Sheet1 Report Created: 11/26/2012 2:13:05 PM Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Engine: GRG Nonlinear Solution Time: 0.031 Seconds. Iterations: 3 Subproblems: 0 Solver Options Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling Convergence 0.0001, Population Size 100, Random Seed 0, Derivatives Forward, Require Bounds Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative Objective Cell (Max) Cell $C$6 Name Profit Original Value 0 Final Value 36

    Variable Cells Cell Name $C$10 x $C$11 y Original Value 0 0 Final Value Integer 4 Contin 6 Contin

    Constraints Cell $C$15 $C$16 $C$17 $C$20 $C$21 Name Assembling Buffing Crating x y Cell Value 16 30 16 0 0 Formula $C$15<=$D$15 $C$16<=$D$16 $C$17<=$D$17 $C$20>=$D$20 $C$21>=$D$21 Status Not Binding Binding Binding Binding Binding Slack 4 0 0 0 0

    Microsoft Excel 14.0 Sensitivity Report Worksheet: [Book1]Sheet1 Report Created: 11/26/2012 2:13:06 PM

    Variable Cells Cell Name $C$10 x $C$11 y Constraints Final Lagrange Cell Name Value Multiplier $C$15 Assembling 16 0 $C$16 Buffing 30 0.666666667 $C$17 Crating 16 1 $C$20 x 0 0 $C$21 y 0 0 Final Value 4 6 Reduced Gradient 0 0

    Microsoft Excel 14.0 Limits Report Worksheet: [Book1]Sheet1 Report Created: 11/26/2012 2:13:06 PM

    Cell $C$6

    Objective Name Profit

    Value 36

    Variable Cell Name $C$10 x $C$11 y

    Value 4 6

    Lower Objective Limit Result 0 24 0 12

    Upper Objective Limit Result 4 36 6 36

    The solution is x = 4, y = 6, and the profit is 36.

    You might also like