Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
Expert Solution & Answer
Book Icon
Chapter 3.9, Problem 12P

Explanation of Solution

Formulation of LP:

Let,

x1 (100s) be the number of litters sold of chemical B

x2 (100s) be the number of litters sold of chemical C

x3 (100s) be the number of litters sold of chemical D

x4 (100s) be the number of litters chemical A purchased.

The profit per 100 litter on chemical B is $12.

for x1 (100s) litters the profit would be 12x1 (100s)

Also, the profit on x2 and x3 litters are 16x2 and 26x3 respectively on chemical C and D.

The total selling price =12x1+16x2+26x3

The cost per 100 litter on chemical A is $6.

If the user purchases x4 (100s)litters of chemical A, then the cost would be 6x4.

For processing x4 (100s)litters of A and x2 litters of C, the processing cost is 3x4+1x2

Subtracting the purchasing cost and processing cost from selling price, the actual profit is found.

Therefore, the objective function is,

Maximize, Z=12x1+16x2+26x3(6x4+3x4+1x2)

Constraint 1:

For, 100 litters of A, 3 hours of labour is needed

For x4 litters of A, 3x4 hours of labour is needed.

Similarly, for 100 litters of C, 1 hour of labour is needed

For, x2 litters of C, x2 hours of labour needed.

Therefore, total labour time required is x2+3x4

Since, only 200 labour hours are available, the constraint is type

Blurred answer
Students have asked these similar questions
7. See the code below and solve the following. public class Test { public static void main(String[] args) { int result = 0; } result = fn(2,3); System.out.println("The result is: + result); // fn(x, 1) = x // fn(x, y) = fn(x, y-1) + 2, when y>1 public static int fn(int x, int y) { if (x <= 1) return x; else return fn(x, y-1) + 2; } } 7-1. This program has a bug that leads to infinite recursion. Modify fn(int x, int y) method to fix the problem. (2 point) 7-2. Manually trace the recursive call, fn(2,3) and show the output (step by step). (2 point) 7-3. Can you identify the Base Case in recursive method fn(int x, int y)? (1 point)
6. See the code below and solve the following. import java.io.*; public class DataStream { } public static void main(String[] args) } DataOutputStream output = new DataOutputStream(new FileOutputStream("temp.dat")); output.writeUTF("Book1"); output.writeInt(85); output.writeUTF("Book2"); output.writeInt(125); output.writeUTF("Book3"); output.writeInt(70); output.close(); // ToDo: Read all data from temp.dat and print the data to the standard output (monitor) 6-1. This program has a compile error, and the message is “Unhandled exception type FileNotFoundException". How do you fix this error? (1 point) 6-2. Is FileNotFoundException a checked exception or an unchecked exception? (1 point) 6-3. What is the difference between checked exception and unchecked exception? (1 point) 6-4. Please complete the above program by reading all data from temp.dat and print the data to the standard output (monitor) by using System.out.print, System.out.println or System.out.printf method. (2 points)
Write a program that reads a list of integers from input and determines if the list is a palindrome (values are identical from first to last and last to first). The input begins with an integer indicating the length of the list that follows. Assume the list will contain a maximum of 20 integers. Output "yes" if the list is a palindrome and "no" otherwise. The output ends with a newline. Hints:   - use a for loop to populate the array based on the specified size (the first number entered)              - use a for loop to check first value with last value, second value with second from end, etc.              - if the values do not match, set a Boolean variable to flag which statement to output (yes or no)   Ex: If the input is (remember to include spaces between the numbers): 6 1 5 9 9 5 1 the output is: yes Ex: If the input is: 5 1 2 3 4 5 the output is: C++ coding

Chapter 3 Solutions

Operations Research : Applications and Algorithms

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