Formulation of LP:

Let,

x1= Number of employees who start work on Sunday and work 5 days.

x2= Number of employees who start work on Monday and work 5 days.

x3= Number of employees who start work on Tuesday and work 5 days.

x4= Number of employees who start work on Wednesday and work 5 days.

x5= Number of employees who start work on Thursday and work 5 days.

x6= Number of employees who start work on Friday and work 5 days.

x7= Number of employees who start work on Saturday and work 5 days.

y1= Number of employees who start work on Sunday and work 5 days.

y2= Number of employees who start work on Monday and work 5 days.

y3= Number of employees who start work on Tuesday and work 5 days.

y4= Number of employees who start work on Wednesday and work 5 days.

y5= Number of employees who start work on Thursday and work 5 days.

y6= Number of employees who start work on Friday and work 5 days.

y7= Number of employees who start work on Saturday and work 5 days.

Then the appropriate LP is given below,

Minimize, z = 250(x1+x2+x3+x4+x5+x6+x7) + 312(y1+y2+y3+y4+y6+y7)

Subject to the constraints,

x1+x4+x5+x6+x7+y1+y3+y4+y5+y6+y7≥11 (Sunday)

x1+x2+x5+x

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 3.5, Problem 2P

Chapter 3.5, Problem 4P

Students have asked these similar questions

Consider the following model of trade between Home and Foreign. Assume throughout that those two countries are the only two countries in the world, at least for purposes of trade. There are two goods: Corn and Radio. Consumers always spend one-third of their income on Corn and the remainder on Radios. The only factor of production is labour. Each home country worker can produce 2 units of Corn or 3 units of Radios per unit of time, while each foreign worker can produce 2 units of Corn or 4 units of Radios per unit of time. There are 30 workers in Home and 60 workers in Foreign. Draw the production possibility frontier for each country (put Corn on the vertical axis and Radios on the horizontal axis).

A person is cutting a long board of wood into different length of pieces . Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut’s lengths and their equivalent prices. Input: board length = 4 Length [ ] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ ] = [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: As noted the best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12

Consider that there are four items that can fit inside a 13-pound-capacity backpack. The respective weights of the items are 5.7, 4, and 3 pounds. Their respective utilities are 8, 11, 6, and 4 utils. Determine the optimal solution that maximizes the overall usefulness of the backpack.

Chapter 3 Solutions

Introduction to mathematical programming

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 Fincos 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 - Prob. 31RP 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

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Recommended textbooks for you

Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole

Operations Research : Applications and Algorithms

Computer Science

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Brooks Cole

SEE MORE TEXTBOOKS

Solution Summary: The author explains how the appropriate LP is given below.

Concept explainers

Explanation of Solution

Want to see the full answer?

Chapter 3 Solutions