LP Formulation:

Let x₁ be the process 1 and x₂ be the process 2.

Let A be the chemical produced and B be the chemical B produced.

Let B₂ be the ounces of chemical that is unsold.

The objective is to maximize Chemco’s revenue.

z= (cost of A) (unit of process 1)+(cost of B) (units of process 2) – (cost of B₂) (units of B unsold)

z= 16(2x1+3x2)+14(x1+2x2−B2)−2B2

Thus, the objective function is,

Maximize,

z= 16(2x1+3x2)+14(x1+2x2−B2)−2B2

Constraint 1: At most, 60 hours of labor are available.

[(hours of labor) (units of chemical produced by process 1)+(hours of labor) (units of chemical produced by process 2)] ≤60

2x1+3x2≤60

Constraint 2: At most, 40 pounds of raw materials are available.

[(pounds of raw material) (units of chemical produced by process 1)+(pounds of material) (units of chemical produced by process 2)] ≤40

x1+2x2≤40

Constraint 3: At most, 20 ounces of chemical B can be sold

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Chapter 3, Problem 14RP

Chapter 3, Problem 16RP

Students have asked these similar questions

A pharma company produces two types of Active Pharmaceutical Ingredients (API), API T and API C. Many biochemical materials are usually necessary to produce a small amount of APIs. To produce 1kg of API T, one must use 5kg and 10kg of biochemical materials W and P, respectively. To produce 1kg of API C, one must use 4 kg and 5 kg of biochemical materials W and P, respectively. It costs $100 and $60 to produce 1kg API T and C, respectively. The pharma company can spend $600 at most to produce the APIs. Taking into account yield uncertainties of the APIs, the pharma company has two goals as follows. Goal 1: The total amount of biochemical material W should be 35kg or more (i.e., approximately 35kg, ideally more than 35kg. In the worst case, the amount is less than 35kg.) Goal 2: The total amount of biochemical material P should be 60kg or less (i.e., approximately 60kg, ideally less than 60kg. In the worst case, the amount is more than 60kg.) The pharma company must determine how much…

The JAV Company manufactures two types of lamps; Special lamp and regular lamp. Each special lamp requires 4 pounds of brass and each regular lamp requires 8 pounds of brass. During each production period, the company's brass supply limited to 640 pounds. Each special lamp requires 6 hours of milling time in the machines and each regular lamp requires 2 hours of milling time in the machine, The company's machine are available only for 360 hours in each production period. Each special lamp requires 5 light bulbs that must be imported from Hongkong. The importation of these bulb is limited to 200 units. The contribution to profit of each special lamp and regular lamp are P400 and P360 respectively. How many units of the special lamp and regular lamp should be produced per production period in order to maximize the profit?

An iron rod is graded based on the following criteria: Magnetite content must be greater than 50 Calcium carbonate must be less than 0.7 Other adulterants must be greater than 5600 The grades are as follows: Grade is A if all three conditions are met. Grade is B if conditions (i) and (ii) are met Grade is C if conditions (ii) and (iii) are met Grade is D if conditions (i) and (iii) are met Grade is E if conditions only one condition is met Grade is F if none of the conditions are met. Write a program in which you ask user to enter the values of Magnetite, Calcium Carbonate and other adulterants. The output will be generated as per the conditions mentioned above. (Put the visible screen shots of the output with 2 to 4 different input variations)

Chapter 3 Solutions

Operations Research : Applications and Algorithms

Ch. 3.1 - Prob. 1P Ch. 3.1 - Prob. 2P Ch. 3.1 - Prob. 3P Ch. 3.1 - Prob. 4P Ch. 3.1 - Prob. 5P Ch. 3.2 - Prob. 1P Ch. 3.2 - Prob. 2P Ch. 3.2 - Prob. 3P Ch. 3.2 - Prob. 4P Ch. 3.2 - Prob. 5P

Ch. 3.2 - Prob. 6P Ch. 3.3 - Prob. 1P Ch. 3.3 - Prob. 2P Ch. 3.3 - Prob. 3P Ch. 3.3 - Prob. 4P Ch. 3.3 - Prob. 5P Ch. 3.3 - Prob. 6P Ch. 3.3 - Prob. 7P Ch. 3.3 - Prob. 8P Ch. 3.3 - Prob. 9P Ch. 3.3 - Prob. 10P Ch. 3.4 - Prob. 1P Ch. 3.4 - Prob. 2P Ch. 3.4 - Prob. 3P Ch. 3.4 - Prob. 4P Ch. 3.5 - Prob. 1P Ch. 3.5 - Prob. 2P Ch. 3.5 - Prob. 3P Ch. 3.5 - Prob. 4P Ch. 3.5 - Prob. 5P Ch. 3.5 - Prob. 6P Ch. 3.5 - Prob. 7P Ch. 3.6 - Prob. 1P Ch. 3.6 - Prob. 2P Ch. 3.6 - Prob. 3P Ch. 3.6 - Prob. 4P Ch. 3.6 - Prob. 5P Ch. 3.7 - Prob. 1P Ch. 3.8 - Prob. 1P Ch. 3.8 - Prob. 2P Ch. 3.8 - Prob. 3P Ch. 3.8 - Prob. 4P Ch. 3.8 - Prob. 5P Ch. 3.8 - Prob. 6P Ch. 3.8 - Prob. 7P Ch. 3.8 - Prob. 8P Ch. 3.8 - Prob. 9P Ch. 3.8 - Prob. 10P Ch. 3.8 - Prob. 11P Ch. 3.8 - Prob. 12P Ch. 3.8 - Prob. 13P Ch. 3.8 - Prob. 14P Ch. 3.9 - Prob. 1P Ch. 3.9 - Prob. 2P Ch. 3.9 - Prob. 3P Ch. 3.9 - Prob. 4P Ch. 3.9 - Prob. 5P Ch. 3.9 - Prob. 6P Ch. 3.9 - Prob. 7P Ch. 3.9 - Prob. 8P Ch. 3.9 - Prob. 9P Ch. 3.9 - Prob. 10P Ch. 3.9 - Prob. 11P Ch. 3.9 - Prob. 12P Ch. 3.9 - Prob. 13P Ch. 3.9 - Prob. 14P Ch. 3.10 - Prob. 1P Ch. 3.10 - Prob. 2P Ch. 3.10 - Prob. 3P Ch. 3.10 - Prob. 4P Ch. 3.10 - Prob. 5P Ch. 3.10 - Prob. 6P Ch. 3.10 - Prob. 7P Ch. 3.10 - Prob. 8P Ch. 3.10 - Prob. 9P Ch. 3.11 - Prob. 1P Ch. 3.11 - Show that Finco’s objective function may also be...Ch. 3.11 - Prob. 3P Ch. 3.11 - Prob. 4P Ch. 3.11 - Prob. 7P Ch. 3.11 - Prob. 8P Ch. 3.11 - Prob. 9P Ch. 3.12 - Prob. 2P Ch. 3.12 - Prob. 3P Ch. 3.12 - Prob. 4P Ch. 3 - Prob. 1RP Ch. 3 - Prob. 2RP Ch. 3 - Prob. 3RP Ch. 3 - Prob. 4RP Ch. 3 - Prob. 5RP Ch. 3 - Prob. 6RP Ch. 3 - Prob. 7RP Ch. 3 - Prob. 8RP Ch. 3 - Prob. 9RP Ch. 3 - Prob. 10RP Ch. 3 - Prob. 11RP Ch. 3 - Prob. 12RP Ch. 3 - Prob. 13RP Ch. 3 - Prob. 14RP Ch. 3 - Prob. 15RP Ch. 3 - Prob. 16RP Ch. 3 - Prob. 17RP Ch. 3 - Prob. 18RP Ch. 3 - Prob. 19RP Ch. 3 - Prob. 20RP Ch. 3 - Prob. 21RP Ch. 3 - Prob. 22RP Ch. 3 - Prob. 23RP Ch. 3 - Prob. 24RP Ch. 3 - Prob. 25RP Ch. 3 - Prob. 26RP Ch. 3 - Prob. 27RP Ch. 3 - Prob. 28RP Ch. 3 - Prob. 29RP Ch. 3 - Prob. 30RP Ch. 3 - Graphically find all solutions to the following...Ch. 3 - Prob. 32RP Ch. 3 - Prob. 33RP Ch. 3 - Prob. 34RP Ch. 3 - Prob. 35RP Ch. 3 - Prob. 36RP Ch. 3 - Prob. 37RP Ch. 3 - Prob. 38RP Ch. 3 - Prob. 39RP Ch. 3 - Prob. 40RP Ch. 3 - Prob. 41RP Ch. 3 - Prob. 42RP Ch. 3 - Prob. 43RP Ch. 3 - Prob. 44RP Ch. 3 - Prob. 45RP Ch. 3 - Prob. 46RP Ch. 3 - Prob. 47RP Ch. 3 - Prob. 48RP Ch. 3 - Prob. 49RP Ch. 3 - Prob. 50RP Ch. 3 - Prob. 51RP Ch. 3 - Prob. 52RP Ch. 3 - Prob. 53RP Ch. 3 - Prob. 54RP Ch. 3 - Prob. 56RP Ch. 3 - Prob. 57RP Ch. 3 - Prob. 58RP Ch. 3 - Prob. 59RP Ch. 3 - Prob. 60RP Ch. 3 - Prob. 61RP Ch. 3 - Prob. 62RP Ch. 3 - Prob. 63RP

Knowledge Booster