Shop

Linear Programming Problem

eBook (PDF), 4 Pages
This item has not been rated yet
Price: $5.99
A box manufacturing plant makes two types of boxes, each of which requires time on the saw for cutting, then time on the assembly and later for finishing. Suppose Model A requires 1 hour cutting, 2 hours of assembly and 1 hour of finishing. Model B requires 1 hour of cutting, 1 hour of assembly and 3 hours of finishing. There are 40 man hours available for cutting per week, 60 man hours for assembly and 90 man hours for finishing. Suppose each model A box sold brings in $20 profit and each model B box sold brings in $25 profit. Determine the number of each box that should be produced to maximize the profit.
Available in PDF Format

Ratings & Reviews

Log in to review this item
There are no reviews for the current version of this product
Refreshing...
There are no reviews for previous versions of this product
Refreshing...

Product Details

Published
April 4, 2013
Language
English
Pages
4
File Format
PDF
File Size
668.73 KB
Product ID
20957268

Formats for this Ebook

PDF
Required Software Any PDF Reader, Apple Preview
Supported Devices Windows PC/PocketPC, Mac OS, Linux OS, Apple iPhone/iPod Touch... (See More)
# of Devices Unlimited
Flowing Text / Pages Pages
Printable? Yes
Report This Content to Lulu >

Moderation of Questionable Content

Thank you for your interest in helping us moderate questionable content on Lulu. If you need assistance with an order or the publishing process, please contact our support team directly.

How does this content violate the Lulu Membership Agreement?

Keywords

Listed In

More From Homework Help Classof1