LP to maximize the daily profit of Ole:

Assume the following,

Let “Ho” be the barrels of heating oil sold.

Let “Gs” be the barrels of gasoline sold.

Let “Jt” be the barrels of jet fuel sold.

Let “Cr1” be the barrels of crude “1” bought.

Let “Cr2” be the barrels of crude “2” bought.

Let “Ho1” be the barrels of distilled crude “1” utilized for heating oil.

Let “Ho2” be the barrels of distilled crude “2” utilized for heating oil.

Let “Ng” be the barrels of naptha utilized for jet fuel.

Let “Nj” be the barrels of naptha utilized for gasoline.

Let “Do1” be the barrels of distilled crude “1” sent via cracker.

Let “Do2” be the barrels of distilled crude “2” sent via cracker.

Let “C1g” be the barrels of cracked oil “1” utilized for gasoline.

Let “C2g” be the barrels of cracked oil “2” utilized for gasoline.

Let “C1j” be the barrels of cracked oil “1” utilized for jet fuel.

Let “C2j” be the barrels of cracked oil “2” utilized for jet fuel.

The correct Linear Programming (LP) formulation is as follows,

max z=14Ho+18Gs+16Jt−12.1Cr1−10.1Cr2−0.15Do1−0.15Do2

S.T.Cr1≤10000Cr2≤100000

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Chapter 3, Problem 61RP

Chapter 3, Problem 63RP

Students have asked these similar questions

IKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…

At the beginning of the first day (day 1) after grape harvesting is completed, a grape grower has 8000 kg of grapes in storage. On day n, for n = 1, 2, . . . ,the grape grower sells 250n/(n + 1) kg of the grapes at the local market at the priceof $2.50 per kg. He leaves the rest of the grapes in storage where each day they dryout a little so that their weight decreases by 3%. Let wn be the weight (in kg) ofthe stored grapes at the beginning of day n for n ≥ 1 (before he takes any to themarket).(a) Find the value of wn for n = 2.(b) Find a recursive definition for wn. (You may find it helpful to draw a timeline.)(c) Let rn be the total revenue (in dollars) earned from the stored grapes from thebeginning of day 1 up to the beginning of day n for n ≥ 1. Find a recursiveformula for rn.(d) Write a MATLAB program to compute wn and rn for n = 1, 2, . . . , num wherenum is entered by the user, and display the values in three columns: n, wn, rnwith appropriate headings.Run the program for num =…

Vandelay Industries has 275 sales reps in order to sell its latex products, each to be assigned to one of four marketing teams. If the first team is to have four times as many members as the second team and the third team is to have five times as many members as the fourth team, how can the members be distributed among the teams?

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