Computers and Technology

A company owner has 1000 shares of company stock she wants to divide among four employees as a bonus. Rather than simply divide the shares equally, she decides to give different amounts based on contribution, time with the company, etc. She decides the distribution must satisfy the following five (5) constraints: a. The first employee gets twice as many shares as the second employee.
b. The third employee gets more shares than the first two together.
c. The fourth employee gets less than the second employee.
d. All the shares must be distributed.
e. Allocations must be in whole numbers—no fractional distributions.

The objective function is to marimize the number of shares the fourth employee gets while satisfying all the constraints. Your solution should be general so that it can be used for distributing any number of shares such as 500 or 1200 shares. In other words, the formula in your solution should not have 1000 embedded in it; but rather, should reference a cell that has the number of shares.

answer
Answers: 2

Other questions on the subject: Computers and Technology

image
Computers and Technology, 22.06.2019 18:30, cascyrio2002
What is outfitting a workplace with video in a technology
Answers: 2
image
Computers and Technology, 23.06.2019 01:20, shiann2002
Me with this program in c++ ! computers represent color by combining sub-colors red, green, and blue (rgb). each sub-color's value can range from 0 to 255. thus (255, 0, 0) is bright red. (130, 0, 130) is a medium purple. (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (in other word, equal amounts of red, green, blue yield gray).given values for red, green, and blue, remove the gray part. ex: if the input is 130 50 130, the output is: 80 0 80. thus, find the smallest value, and then subtract it from all three values, thus removing the gray.
Answers: 3
image
Computers and Technology, 23.06.2019 10:20, chonawilson4
Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?
Answers: 1
image
Computers and Technology, 23.06.2019 15:00, victordhernandez01
Jake really works well with numbers and is skilled with computers but doesn't work well with others. which of the jobs discussed in this unit might be best for jake? why?
Answers: 3
Do you know the correct answer?
A company owner has 1000 shares of company stock she wants to divide among four employees as a bonus...

Questions in other subjects:

Konu
History, 18.09.2020 14:01
Konu
Mathematics, 18.09.2020 14:01
Konu
Biology, 18.09.2020 14:01
Konu
Mathematics, 18.09.2020 14:01
Konu
World Languages, 18.09.2020 14:01
Konu
Mathematics, 18.09.2020 14:01
Konu
Mathematics, 18.09.2020 14:01
Konu
Mathematics, 18.09.2020 14:01
Konu
Social Studies, 18.09.2020 14:01
Konu
Mathematics, 18.09.2020 14:01