CKC to maximize profits:

Let x₁ be the units of process 1 and x₂ be the units of process 1.

Let x₃ be the number of modeling hours hired.

The objective is to maximize Candy Kane Cosmetics profits.

Revenues = (total cost) [(units of perfume produced by process 1)+(units of perfume produced by process 2)] – (cost of labor/unit) [(units of labor required in process 1)+(unit of labor required in process 2)] – (cost of chemical/unit)[(units of chemical required in process 1)+(unit of chemical required in process 2)] – (total cost) (modeling hours hired) = 5(3x1+5x2)−3(x1+2x2)−2(2x1+3x2)−100x3

Thus, the objective function is,

Maximize

z = 5(3x1+5x2)−3(x1+2x2)−2(2x1+3x2)−100x3

the following constraints are,

Constraint 1: At most, 20000 of labor can be purchased each year.

Constraint 2: At most, 35000 units of chemical can be purchased each year.

Constraint 1: At most, 1000oz of perfume can be sold

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Chapter 3, Problem 8RP

Chapter 3, Problem 10RP

Students have asked these similar questions

What are the major threats of using the internet? How do you use it? How do children use it? How canwe secure it? Provide four references with your answer. Two of the refernces can be from an article and the other two from websites.

Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…

What did you find most interesting or surprising about the scientist Lavoiser?

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

Solution Summary: The author explains how the objective function is to maximize Candy Kane Cosmetics profits.

Explanation of Solution

Chapter 3 Solutions