Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
4th Edition
ISBN: 9780534423551
Author: Wayne L. Winston
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3.4, Problem 3P
Explanation of Solution
a.
Given:
Let
The objective function is
Considering the constraints,
Constraint 1: At least 12 units of vitamin A is required.
Constraint 2: At least 6 units of vitamin C is required.
Expressing the constraint 1 in terms of
Expressing the constraint 2 in terms of
Mathematical model of given LP is,
Subject to the constraints,
Explanation of Solution
b.
Subject to the constraints,
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
A farmer in Georgia has a 100-acre farm on which to plant watermelons and cantaloupes. Every acre planted with watermelons requires 50 gallons of water per day and must be prepared for planting with 20 pounds of fertilizer. Every acre planted with cantaloupes requires 75 gallons of water per day and must be prepared for planting with 15 pounds of fertilizer. The farmer estimates that it will take 2 hours of labor to harvest each acre planted with watermelons and 2.5 hours to harvest each acre planted with cantaloupes. He believes that watermelons will sell for about $3 each, and cantaloupes will sell for about $1 each. Every acre planted with watermelons is expected to yield 90 salable units. Every acre planted with cantaloupes is expected to yield 300 salable units. The farmer can pump about 6,000 gallons of water per day for irrigation purposes from a shallow well. He can buy as much fertilizer as he needs at a cost of $10 per 50-pound bag. Finally, the farmer can hire laborers to…
Your English professor has announced the following grading policy: For each essay, the highest score in the class will be entered as a 100%; all other scores will be entered as the percent of that top score. For example, if the highest essay is a 50 out of 100, it will be counted as a perfect paper, and essays with a score of 40 out of 100 will be entered as an 80%. The final grade for the course will be determined using these adjusted percentages, with 90% and above an A, 80% and above a B, 70% and above a C and below 70% not passing.
The students all get together and decide not to work hard on the next paper because if nobody does well, they will all do okay. This plan
results in a Nash Equilibrium.
A.) is a solid commitment device, and thus stable.
B.) will be unstable because there is an incentive to break the agreement.
C.) will be stable because there are no incentives to deviate.
D.) requires everyone to follow their…
Mr Monkey is standing in front of a row of banana trees on Skull Island which actually
belong to his rival King Kong. The banana trees are unusually high on that island. He wants
to steal as many bananas as possible. Here is his plan. He will climb up one of the trees and
then keep jumping from one tree to the immediately next one, while collecting all the bananas
from each of them. But he will not switch the direction of his jumps. No longer being the
agile young monkey he once used to be, he can only jump a total distance of L, after which
he will climb down and run away before Kong crushes his head.
Let the trees be labelled as t1, t2, ·.· tn. Let v;, Vi = 1, 2, · ..n be the number of bananas
in tree t;. Further, let l;, i = 1,2,
Can you write an algorithm to help Mr. Monkey steal as many bananas as possible ? Your
algorithm should be a polynomial in n, L. Please show all the steps of DP as in the sample
solution - subproblem definition, recurrences, pseudocode, runtime .
(Statutory…
Chapter 3 Solutions
Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
Ch. 3.1 - Prob. 1PCh. 3.1 - Prob. 2PCh. 3.1 - Prob. 3PCh. 3.1 - Prob. 4PCh. 3.1 - Prob. 5PCh. 3.2 - Prob. 1PCh. 3.2 - Prob. 2PCh. 3.2 - Prob. 3PCh. 3.2 - Prob. 4PCh. 3.2 - Prob. 5P
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
Knowledge Booster
Similar questions
- Fergusonball players are given a star rating based on the number of points that they score and the number of fouls that they commit. Specifically, they are awarded 5 stars for each point scored, and 3 stars are taken away for each foul committed. For every player, the number of points that they score is greater than the number of fouls that they commit. Your job is to determine how many players on a team have a star rating greater than 40. You also need to determine if the team is considered a gold team which means that all the players have a star rating greater than 40. Input Specification The first line of input consists of a positive integer N representing the total number of players on the team. This is followed by a pair of consecutive lines for each player. The first line in a pair is the number of points that the player scored. The second line in a pair is the number of fouls that the player committed. Both the number of points and the number of fouls, are non-negative integers.…arrow_forwardSanta is worried about his employee relations, since christmas preparations have led to a lot of overtime. To make sure all the elves are happy, he wants to recruit some of them as complaint officers, with weekly meetings to report any complaints or worries to him. His worker elves W are pretty busy already, so Santa wants to task no more than k elves with this additional workload. Still, Santa wants to make sure that for as many elves e e W as possible, at least one of his friends (whose identities he knows) is a complaint officer. 1. Give an intuitive greedy algorithm that outputs k elves that will serve as compliant officers. 2. Prove that for large numbers of k the algorithm approximates a solution with ratio no more than (1 - ).arrow_forwardAdmission to college is just beginning and Chef has also just finished his high school. There are N colleges, listed from 11 to N, and listed from 11 to N. Each college has only one seat left. To apply for a college, each student must submit the same examination, the result of which determines their future, that is, the best student (the highest scorer) gets the first choice of college. Each student has a list of favourite colleges. They will want to get to the top ranked college on their list. If they can't get into it, they'll want to get into a second-ranked college in the middle of their list, and so on. If one vacant college seat is filled, that year's admission closes at that college. Then, people who have applied for that college should look for a lower college in their preferred list as long as it still has vacancies. Looking at the information about MM students, about their exam scores (given as standards) and the college IDs they apply for, find out which college the Chef…arrow_forward
- A new movie has just been released " Interstellar"! There are a lot of people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 dollar bill. An " Interstellar" ticket costs 25 dollars. - Ali is currently working as a clerk. He wants to sell a ticket to every single person in this line. Can Ali sell a ticket to every person and give change if he initially has no money and sells the tickets strictly in the order people queue? ▪ Print YES, if Ali can sell a ticket to every person and give change with the bills he has at hand at that moment. Otherwise print NO. W When run on following sequence: [ 25, 25, 50]: Output is YES - When run on following sequence: [ 25, 100]: Output is NO When run on following sequence: [ 25, 25, 50, 50, 100]: Output is NO (As Ali will not have the right bills to give 75 dollars of change (you can't make two bills of 25 from one of 50)arrow_forwardThree prisoners have been sentenced to long terms in prison, but due to over crowed conditions, one prisoner must be released. The warden devises a scheme to determine which prisoner is to be released. He tells the prisoners that he will blindfold them and then paint a red dot or blue dot on each forehead. After he paints the dots, he will remove the blindfolds, and a prisoner should raise his hand if he sees at least one red dot on the other two prisoners. The first prisoner to identify the color of the dot on his own forehead will be release. Of course, the prisoners agree to this. (What do they have to lose?) The warden blindfolds the prisoners, as promised, and then paints a red dot on the foreheads of all three prisoners. He removes the blindfolds and, since each prisoner sees a red dot (in fact two red dots), each prisoner raises his hand. Some time passes when one of the prisoners exclaims, "I know what color my dot is! It's red!" This prisoner is then released. Your problem…arrow_forwardYou are given an exam with questions numbered 1, 2, 3, . . . , n. Each question i is worth pi points and has a frustration score fi . You must answer the questions in order, but you may choose to skip some questions. The reason you might choose to do this is that even though you can solve any individual question i and obtain the ???? points, some questions are so frustrating that after solving them you will be unable to solve any of the following fi questions. Suppose that you are given the pi and fi values for all the questions as input. Devise an efficient algorithm you can for choosing a set of questions to answer that maximizes your total points, and compute its asymptotic worst case running time as a function of n.arrow_forward
- To reduce traffic congestion in downtown Winburg, Indiana, the mayor convinces the city toset up a public transportation system. Bus-only lanes are to be established, and commuterswill be encouraged to “park and ride”; that is, to park their cars in suburban parking lots andthen take buses from there to work and back at cost of one dollar per ride. Each bus is tohave a fare machine that accepts only one dollar bills. Passengers insert a bill into the slotsas they enter the bus. Sensors inside the fare machine scan the bill, and the software in themachine uses an image recognition algorithm to decide whether the passenger has indeedinserted a valid dollar bill into the slot. It is important that the fare machine be accuratebecause, once the news gets out that any piece of paper will do the trick, fare income willplummet to effectively zero. Conversely, if the machine regularly rejects valid dollar bills,passengers will be reluctant to use the buses. In addition, the fare machine must be…arrow_forwardRaghu and Sayan both like to eat (a lot) but since they are also looking after their health, they can only eat a limited amount of calories per day. So when Kuldeep invites them to a party, both Raghu and Sayan decide to play a game. The game is simple, both Raghu and Sayan will eat the dishes served at the party till they are full, and the one who eats maximum number of distinct dishes is the winner. However, both of them can only eat a dishes if they can finish it completely i.e. if Raghu can eat only 50 kCal in a day and has already eaten dishes worth 40 kCal, then he can't eat a dish with calorie value greater than 10 kCal.Given that all the dishes served at the party are infinite in number, (Kuldeep doesn't want any of his friends to miss on any dish) represented by their calorie value(in kCal) and the amount of kCal Raghu and Sayan can eat in a day, your job is to find out who'll win, in case of a tie print “Tie” (quotes for clarity). Input:First line contains number of test…arrow_forwardIn order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test case contains…arrow_forward
- Problem You have a fence post located at the point (x,y) where a goat is tethered by a rope. You also have a house, which is a rectangle with diagonally opposite corners at the points bottom-left: (x1,y1) and top-right: (x2,y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope. Recall that the distance formula is: (x2−x1)2+(y2−y1)2 The input consists of a single line containing six space-separated integer values: x, y, x1, y1, x2, and y2. You are guaranteed that x1<x2 and y1<y2, and that (x,y) is strictly outside the axis-aligned rectangle with corners at (x1,y1) and (x2,y2). Return the minimum distance from the goat’s post to the house as a floating-point value from main(). Learning Objectives Be able to create a program with a lesser template. Be able to calculate the min/max of integers. Be able to write a mathematical…arrow_forwardJin Mori is like any other student who loves sleeping. Jin Taejin, his grandfather, imposes a waking schedule that Jin Mori must follow to avoid tardiness at his school. The schedule stated that on weekdays, Mori must be awake at "7:00" and at "10:00" at weekends. Taejin added an exemption for their school vacation. If it is their school vacation, the schedule is "10:00" for weekdays and "off" for weekends. If Jin will not follow the schedule, he is not allowed to practice his favorite martial art, taekwondo. Your job is to create a program that will serve as the alarm clock for Jin Mori. Expected Output: Test Case 1: Vacation: False Day: Monday Alarm Time: 7:00 Awake: Yes Be ready for your practice Mori! Test Case 2: (input) (input) (auto generated) (input) Vacation: False Day: Saturday Alarm Time: 10:00 Awake: No (input) (input) (auto generated) (input) You are not allowed to practice your taekwondo!arrow_forwardA large apple farm distributes their apples in boxes that they can source from any one of a number of nearby box manufacturers. Each box manufacturer makes only one box type that holds a specific number of apples - so a box from one manufacturer might hold 24 apples, while a box from another might hold 13. The apple farm can only choose one box supplier each year (a decision they make each year based on price), but they can then order an unlimited number of boxes of that type. The farm likes to be prepared, and creates large batches of apples to pack before the decision about which box type to use has been made. The farm also likes to limit waste, and tries to set the number of apples in these large batches such that they can fill an integer number of boxes perfectly with no apples left over. In creating these batches, although the farm doesn't yet know the exact capacity of the boxes they will buy, they know a list of possible values the box capacity will take. For example, if the…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole