Scribd
Upload
100 views2 pages

MGMT 114n Problem Set4 Linear Programming

The document contains three linear programming problems. The first problem involves maximizing profits from producing two products given constraints on available hours for electronic work and assembly. The second problem involves minimizing costs of producing two chemical products given constraints on minimum production amounts and total production. The third problem involves maximizing profits from producing four products given constraints on time required in different production departments.

Uploaded by

lyriemaecutara0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100 views2 pages

MGMT 114n Problem Set4 Linear Programming

The document contains three linear programming problems. The first problem involves maximizing profits from producing two products given constraints on available hours for electronic work and assembly. The second problem involves minimizing costs of producing two chemical products given constraints on minimum production amounts and total production. The third problem involves maximizing profits from producing four products given constraints on time required in different production departments.

Uploaded by

lyriemaecutara0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Mgmt 114n Introduction to Management Science

Name __________________________ Score______________

Problem Set # 3 Linear Programming


Formulate the LP Equation for each of the problems given below:
1. The Glickman Electronics Company, produces two products: (1) the Glickman x-
pod and (2) the Glickman BlueBerry. The production process for each product is
similar in that both require a certain number of hours of electronic work and a
certain number of labor-hours in the assembly department. Each x-pod takes 4
hours of electronic work and 2 hours in the assembly shop. Each BlueBerry
requires 3 hours in electronics and 1 hour in assembly. During the current
production period, 240 hours of electronic time are available, and 100 hours of
assembly department time are available. Each x-pod sold yields a profit of $7;
each BlueBerry produced may be sold for a $5 profit.

2. Cohen Chemicals, Inc., produces two types of photo-developing fluids. The first,
a black-and-white picture chemical, costs Cohen $2,500 per ton to produce. The
second, a color photo chemical, costs $3,000 per ton. Based on an analysis of
current inventory levels and outstanding orders, Cohen’s production manager
has specified that at least 30 tons of the black-and-white chemical and at least 20
tons of the color chemical must be produced during the next month. In addition,
the manager notes that an existing inventory of a highly perishable raw material
needed in both chemicals must be used within 30 days. To avoid wasting the
expensive raw material, Cohen must produce a total of at least 60 tons of the
photo chemicals in the next month. Note: Formulate this information as a
minimization LP problem.
3. Failsafe Electronics Corporation primarily manufactures four highly technical
products, which it supplies to aerospace firms that hold NASA contracts. Each of
the products must pass through the following departments before they are
shipped: wiring, drilling, assembly, and inspection. The time requirements in each
department (in hours) for each unit produced and its corresponding profit value
are summarized in the table below.

You might also like