Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3, Problem 35RP
Explanation of Solution
Formulation of Linear
Let “x1” be the type 1 layout, “x2” be type 1 layout, and “x3” be type 3 layout.
The objective is to maximize the profit.
Therefore, the objective function is,
Maximize,
Constraint 1:
At most, 1000 tulips are available.
Constraint 2:
At most, 800 daffodils are available
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Solve the following exercise using jupyter notebook for Python, to find the objective function, variables, constraint matrix and print the graph with the optimal solution.
A farm specializes in the production of a special cattle feed, which is a mixture of corn and soybeans. The nutritional composition of these ingredients and their costs are as follows:
- Corn contains 0.09 g of protein and 0.02 g of fiber per gram, with a cost of.$0.30 per gram.- Soybeans contain 0.60 g of protein and 0.06 g of fiber per gram, at a cost of $0.90 per gram.0.90 per gram.
The dietary needs of the specialty food require a minimum of 30% protein and a maximum of 5% fiber. The farm wishes to determine the optimum ratios of corn and soybeans to produce a feed with minimal costs while maintaining nutritional constraints and ensuring that a minimum of 800 grams of feed is used daily.
Restrictions
1. The total amount of feed should be at least 800 grams per day.2. The feed should contain at least 30% protein…
Refer to the following hypothetical situation to come up with a linear programming solution maximizing profit for a local ice-cream shop.
The objective: On average, you get $1 in revenue from every pound of ice cream you sell. You get $5 for every ice cream cake (neglect the cake size here) you sell in the market. You need to bring in as much revenue as you can to keep your shop running on a day-to-day basis.
The decisions: You need to figure out what mix of ice creams (per pound) and the number of ice cream cakes to produce each month to maximize total profit.
The constraints: It costs $0.5 or 50 cents to produce a pound of ice cream and $4 to produce one ice cream cake (on average). You have a budget of $100 per day to devote to producing new products for sale. You must also store this stuff in your 10 cubic meter freezer. Every pound of ice cream takes up .1 cubic meters once packed, and every cake (on average) takes up 0.25 cubic meters. You can't store these products elsewhere…
Refer to the following hypothetical situation to come up with a linear programming solution maximizing profit for a local ice-cream shop.
The objective: On average, you get $1 in revenue from every pound of ice cream you sell. You get $5 for every ice cream cake (neglect the cake size here) you sell in the market. You need to bring in as much revenue as you can to keep your shop running on a day-to-day basis.
The decisions: You need to figure out what mix of ice creams (per pound) and the number of ice cream cakes to produce each month to maximize total profit.
The constraints: It costs $0.5 or 50 cents to produce a pound of ice cream and $4 to produce one ice cream cake (on average). You have a budget of $100 per day to devote to producing new products for sale. You must also store this stuff in your 10 cubic meter freezer. Every pound of ice cream takes up .1 cubic meters once packed, and every cake (on average) takes up 0.25 cubic meters. You can’t store these products elsewhere…
Chapter 3 Solutions
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
- You are given some tasks of size xK, yK and zK respectively and there are at most 9 tasks each. Determine the best that you could achieve if you are to fill up a hole of size SK, for the following values of x, y, z and S, by maximizing the space used (up to S), i.e. minimizing the used space, if any. Show how many tasks of size x, how many tasks of size y and how many tasks of size z are used in each of the three cases. (g) Now if we relax the requirement so that there are no upper limits on the number of tasks for each type, determine the maximal space usage and the task mix. (h) If we tighten the requirement so that there are still at most 9 tasks of each size, but we also require that each type of tasks must be used at least once, determine maximal space usage and the task mix. Case 1 2 3 X 22 26 28 y 33 43 65 50 77 74 S 488 556 777 You could complete the following table. Fill in the number of tasks inside the brackets and the corresponding maximal usage. (At most 9 tasks each (g)…arrow_forwardwrite a linear integer programming of the below problem Formulate the following manpower planning problem in mathematical programming terms.Given a set of workers and a set of 15 working hours per day with a required staffing per hour. Determinethe minimum number of people required to cover the workload requirements, knowing that a personworks in shifts that cover 7 hours and a person starting in hour contributes to the workload in hoursi,........,i+ 6 (eg: a person starting in hour 3 contributes to the workload in hours 3,4,5,6,7,8,9).arrow_forward6. Consider a modification to the rod-cutting problem in which, in addition to a value pi for each rod, there is handling cost ci that is one and a half times the length of the rod cut plus a flat fee of 3 (i.e., the handling cost to cut a rod of length 5 is 7.5+3 =10). The revenue generated is the sum of the value of the pieces cut minus the sum of handling costs of the cuts. Provide a dynamic programming approach to solve this problem given an initial rod of length n with potential cut lengths of 1, 2, 5, and 7 [Adapted from ITA, pg. 370, 15.1-3] length of cut (i) 1 2 5 7 value (pi) 5 7 30 45 handling cost (ci) 4.5 6 10.5 13.5arrow_forward
- [Very Hard] Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment. If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit of 4.5 dollar. For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100. Complete the RECURSIVE methods below that take an array of integers (investments) and an iterator (always…arrow_forwardA farmer is planning to raise wheat and barley. Each acre of wheat yields a profit of $50, and each acre of barley yields a profit of $70. To sow the crop, two machines, a tractor and a tiller are rented. The tractor is available for 150 hours, and the tiller is available for 200 hours. Sowing an acre of wheat requires 4 hours of tractor time and 1 hour of tilling. Sowing an acre of barley requires 3 hours of tractor time and 2 hours of tilling. How many acres of each crop should be planted to maximize the farmer’s profit? (Let W be the number of acres of wheat to be planted, B the number of acres of barley to be planted and P the profit) What is the objective function for the problem? Excluding the non-negative constraint, how many constraints does the problem have? What is the linear programming model of the problem? In the initial tableau, what is the leaving variable? What is the pivot element in the initial tableau? What is the optimal solution to the problem? After how many…arrow_forwardA ski rental agency has n pairs of skis, where the height of the the ith pair of skis is si . There are n skiers who wish to rent skis, where the height of the ith skier is hi. Ideally, each skier should obtain a pair of skis whose height matches her/his own height as closely as possible. We would like to assign skis to skiers so that the sum of the absolute differences of the heights of each skier and her/his skis is minimized. Design a greedy algorithm for the problem. Prove the correctness of your algorithm. (Hint: Start with two skis and two skiers. How would you match them? Continue to three skis and three skiers, and identify a strategy.)arrow_forward
- IKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…arrow_forwardConsider 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).arrow_forwardSolve the linear programming below by (a) graphing and (b)using simplex method. A certain company makes 2 models of motorcycles, model 2A and model 2B. Both models pass through assembling and painting. A model 2A motorcycle needs 4 hours for in assembling and 3 hours in painting. A model 2B motorcycle needs 8 hours in assembling and 12 hours in painting. Machines in assembling are available for 64 hours, while those in painting, 72 hours. The profit for each model 2A motorcycle is P2700 and P3600 for a model 2B motorcycle. How many model 2A and 2B motorcycles must be manufactured to maximize profit? What is the maximum profit? Solve by graphing Correct objective function and constraints Correct Process (conversion-determining points – verifying at point (0,0) Correct graphand correct values and interpretation of x, y, and z Using Simplex method Correct placement of values of the first matrix Correct process and complete solution (determining the pivot row, column, and…arrow_forward
arrow_back_ios
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