A local merchant goes to a market to buy apples with 500 UM. They offer two types of apples: green ones at 0.5 UM per kg and red ones at 0.8 UM per kg. We know that he only has space in his van to transport a maximum of 700 kg of apples and that he plans to sell a kilo of green apples for 0.58 UM and red apples for 0.9 UM. Graph this operations research problem. - How many kilograms of apples of each type should you buy to obtain maximum profit?

A local merchant goes to a market to buy apples with 500 UM. They offer two types of apples: green ones at 0.5 UM per kg and red ones at 0.8 UM per kg. We know that he only has space in his van to transport a maximum of 700 kg of apples and that he plans to sell a kilo of green apples for 0.58 UM and red apples for 0.9 UM. Graph this operations research problem. - How many kilograms of apples of each type should you buy to obtain maximum profit?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter11: Nonlinear Programming

Section11.9: The Kuhn–tucker Conditions

Problem 1P

See similar textbooks

Similar questions

Mr. Cook is the manager of Code cinemas and after a long break the theatres are open to the public again. To compensate for the loss of revenue due to Covid-19, Mr. Chef wants to maximise profits from each show from now on, while following the guidelines set by the government. The instructions are: If two people are sitting in the same row, there must be at least one free seat between them. If two people are sitting in different rows, there must be at least one completely empty row between them. This means that if there are people sitting in rows i and j where i
You are tasked with shipping a number n of goods g; E {1, ... , n} to a target location t;. In your very rural area, the roads are in bad shape and often blocked by trees and the like, and also, there are only three cargo companies you can use for the transport of any good g;. You have to order one truck for each good, and know the companies' routes Pi,1, Pi2 and Pi3 they would take to all specific locations, where each route consists of a sequence of road segments that it uses. Now since you are aware of the frequent road blockages, and you want not too many of your transports to be obstructed, your aim is to pick the paths Pij for each good in such a way that max{E.EP. 1|e e E} is as small as possible. (a) Formulate the problem as an ILP, and relax to an according LP. (b) Give a rounding algorithm to compute a feasible solution starting from the LP optimum that guarantees a 3- approximation to the optimal solution, and prove its approximation guarantee.
Maps Remaining Time: 58 minutes, 28 seconds. Question Completion Status: QUESTION 11 Rs 120 2 Vs 20 V RL The source in Figure 2 has an internal resistance of 120 Ohm. Determine the load power for each of the following values of the variable load resistance (a) 00 O a. 330 mW O b.0 mW O c. 450 mW O d. 500 mW
Two buses, X and Y, start their journey at the same time on a 950 km route. Bus X gives a 1-hour break after every 3 hours' drive. So, it is at rest at the 4th, 8th, 12th, 16th, 20th, ... hours. Bus Y gives a 1-hour break after every 4 hours' drive. So, it is at rest at the 5th, 10th, 15th, 20th, 25th,... hours. You are given the speeds of the two buses Vx and Vy as 80 and 75, respectively. Write a program that does the following: • Evaluate and display at the end of every hour the distance traveled by each bus. When either one of the buses reach their destination, the evaluations terminate. Depending on whether X or Y or both reach their destination in the last hour, display one of the following messages before stopping (where n is the number of hours): o "Within hour n, bus X reaches its destination." "Within hour n, bus Y reaches its destination." o "Within hour n, both buses reach their destinations." Sample screen output: After hour 1, X is at 80 km, Y is at 75 km. After hour 2, X…
The motorway management perceives that the waiting time computed in (a) above is not acceptable and it wishes to reduce it, first, by adding an extra tollbooth assistant to help improve the service rate to 250 motorists every 8-hour-day. The tollbooth attendant will be paid a monthly salary of GH¢400. The second option is that management can add a toll-operated machine which will cost GH¢3,000 and this amount is a free gift from the Minister. This option will reduce the arrival rate to 35 motorists every 2 hours. However, management will have to pay the operator who will man the toll-operated machine a monthly salary of GH¢550. Whichever option management adopts; they avoid lost sales of GH¢1,200.00 per month for every minute that average waiting time is reduced. Advise management which option it must adopt?
Please send me answer within 10 min!! I will rate you good for sure!! Please provide some explanation!! Every person has a name and an address. A person is uniquely identified by their name. There are two groups of persons, staff and students. A person can be a student and staff at the same time Every staff receives a salary, while every student pays a fee. Among the staff, there is research and teaching staff. A staff can belong to both groups. Among the teaching staff, there are lecturers and TAs. A TA works for several courses. (course does not need to be an entity, just add a courseID attribute to an entity TA) Every student is either a graduate student or an undergraduate student. A graduate student has a thesis title, on which he/she is working. An undergrad is in the final year if he/she is in his/her 4th year. Every final year student is working on a project. Every final year student is supervised by a member of the teaching staff. Your task: Design an E-R diagram that…
Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees) You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph. Your job is as follows; a) Translate the given information in the form of Graph (Vertices & edges) b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes. c) What is the cost of repairing of resulting rail network?
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…
Figure 1 shows the power curve of a single turbine that is used in the Block Island Wind Farm. There are five turbines in this wind farm. 6 Power Curve (MW) 3 To 3 ↑ Wind Speed The wind speed at hub height of the turbine in 24 hours are as follows: 20 ✓rated 7.5 12 Figure 1 - Power Curve of a Turbine in the Block Island Wind Farm Cut in \\\ 30 10 25 2 cut out 4 8 12 16 20 24 Figure 2- Wind Speed Histogram
Nawras Tech assembles laptop computers from generic components. It purchases its colour monitors from a manufacturer in Taiwan with a lead time of one week. Daily demand for monitors is normally distributed with a mean of 30 monitors and a standard deviation of 8 monitors. The company has determined that the ordering cost is OMR 125 per order, the annual holding cost is OMR 25 per monitor, and the stockout cost is OMR 160 per lost sale. Currently, Nawras Tech accepts a 5% risk of stockout. Assume 350 days per year and 7 days in a week. a) Calculate the current fill rate. b) What is the annual cost of lost sales?
The following below gives the gain of an antenna and efficiency. Use it to solve the following question G= 10'log10 (K* (m"D)yA) Where, G is Gain in dB K is efficiency of antenna D is antenna diameter(m) A= c/f,f=operating frequency c=3 x 10° m/s G/10 Efficiency = (Nrp• (10) Let initial Antenna diameter = 2.4 meter, Antenna Gain (dBi) = 43, Antenna frequency = 6000 MHz Vary D from 2.4 to 5.6 with a change of 0.2. i. Plot a graph of K vrs D for D=2.4 to 5.6 with a change of 0.02 ii. Plot a graph of K vrs D for D=2.4 to 5.6 with a change of 0.01 iii. Write a c++ code to solve for i. iv. Write a c++ code to solve for ii.
Major Luna is sending military troops from his base (A) to the town of G. However, there is no direct route between A and G. Instead, the troops must pass through other places, namely: B, C, D, E, and F. The following routes are possible: A to B, A to C, B to F, C to D, C to E, D to G, E to G, and F to G. For some reason, such places can only accommodate a number of soldiers going through these places. B, C, D, E, and F has a capacity of 3, 3, 9, 6, and 4 soldiers. b. Solve the problem using the Ford-Fulkerson algorithm.