Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y <= 47, and X + Y <= 141. Which one of the following is true?: a. Slack for each constraint is zero. b. Optimal Obj. function value is 94 c. X=70.5, Y=70.5 is the only optimal solution. d. Optimal Obj. function value is 0

Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y <= 47, and X + Y <= 141. Which one of the following is true?: a. Slack for each constraint is zero. b. Optimal Obj. function value is 94 c. X=70.5, Y=70.5 is the only optimal solution. d. Optimal Obj. function value is 0

Name: Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y
Uploaded: 2024-03-20T06:57:05.000Z
Channel: Bartleby
Description: Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y <= 47, and X + Y <= 141. Which one of the following is true?:a.Slack for each constraint is zero.b.Optimal Obj. function value is 94c.X=70.5, Y=70.5 is the only optimal solution.d.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.5: Shortest Path Models

Problem 32P

See similar textbooks

Similar questions

The Tinkan Company produces one-pound cans for the Canadian salmon industry. Each year the salmon spawn during a 24-hour period and must be canned immediately. Tinkan has the following agreement with the salmon industry. The company can deliver as many cans as it chooses. Then the salmon are caught. For each can by which Tinkan falls short of the salmon industrys needs, the company pays the industry a 2 penalty. Cans cost Tinkan 1 to produce and are sold by Tinkan for 2 per can. If any cans are left over, they are returned to Tinkan and the company reimburses the industry 2 for each extra can. These extra cans are put in storage for next year. Each year a can is held in storage, a carrying cost equal to 20% of the cans production cost is incurred. It is well known that the number of salmon harvested during a year is strongly related to the number of salmon harvested the previous year. In fact, using past data, Tinkan estimates that the harvest size in year t, Ht (measured in the number of cans required), is related to the harvest size in the previous year, Ht1, by the equation Ht = Ht1et where et is normally distributed with mean 1.02 and standard deviation 0.10. Tinkan plans to use the following production strategy. For some value of x, it produces enough cans at the beginning of year t to bring its inventory up to x+Ht, where Ht is the predicted harvest size in year t. Then it delivers these cans to the salmon industry. For example, if it uses x = 100,000, the predicted harvest size is 500,000 cans, and 80,000 cans are already in inventory, then Tinkan produces and delivers 520,000 cans. Given that the harvest size for the previous year was 550,000 cans, use simulation to help Tinkan develop a production strategy that maximizes its expected profit over the next 20 years. Assume that the company begins year 1 with an initial inventory of 300,000 cans.
Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0
Problem 16-15 (Algorithmic) Strassel Investors buys real estate, develops it, and resells it for a profit. A new property is available, and Bud Strassel, the president and owner of Strassel Investors, believes if he purchases and develops this property it can then be sold for $160,000. The current property owner has asked for bids and stated that the property will be sold for the highest bid in excess of $100,000. Two competitors will be submitting bids for the property. Strassel does not know what the competitors will bid, but he assumes for planning purposes that the amount bid by each competitor will be uniformly distributed between $100,000 and $150,000. Develop a worksheet that can be used to simulate the bids made by the two competitors. Strassel is considering a bid of $130,000 for the property. Using a simulation of 1000 trials, what is the estimate of the probability Strassel will be able to obtain the property using a bid of $130,000? Round your answer to 1 decimal place.…
Fopic 4- Linear Programming: Appli eBook Problem 9-05 (Algorithmic) Kilgore's Deli is a small delicatessen located near a major university. Kilgore's does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The profit on one serving of Wimpy is $0.46, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.26 pound of beef, 0.26 cup of onions, and 6 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.26 pound of beef, 0.41 cup of onions, 3 ounces of Kilgore's special sauce, and 6 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. a. Develop a linear programming model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today.…
Please show how to solve b
find the a. decision variables b. objective function c. constraints
Maximize Profit=123 L + 136 S 17 L+11 S≤ 3000 6 L+9 S≤2500 L20 and S20 (Availability of component A) (Availability of component B) Show Transcribed Text Implement the linear optimization model and find an optimal solution. Interpret the optimal solution. The optimal solution is to produce LaserStop models and SpeedBuster models. This solution gives the possible profit, which is $. (Type integers or decimals rounded to two decimal places as needed.)
LPP Model Maximize P = 12x + 10y Subject to : 4x + 3y < 480 2x + 3y < 360 X, y 2 0 Which of the following points (x, y) is feasible? A) ( 120, 10) B ( 30, 100 ) c) ( 60, 90 ) D) ( 10, 120 )
4. Optimal Rental Decisions in Cloud Computing Assume that AWS has the following 3 options for renting servers. Fraction of Job in one Server Description Rental Low Power Medium Power High Power $2/hr. $4/hr. $9/hr. Hour 1/8 1/6 1/3 L M Note that if you rent a server for less than one hour, you still must pay the rent for the entire hour. You have a job that must finısh in at most 5 hours. The low-power server can finish 1/8th of the job in 1 hour, the medium-power server can finish 1/6 of the job in one hour, and the high- power server can finish 1/3rd of the job in one hour. (a) The typical practice used by most firms is to find a single server that can do the work at the least cost and within the available time. Find the best sıngle server solution-that is, which single server should you use and for how many hours will you rent this server?
What combination of x and y will yield the optimum for this problem? Maximize Z = $3x + $15y Subject to: Multiple Choice x= 0, y=4 x= 0, y=3 x= 0, y=0 x= 2y=0 O x=1,y=25 2x + 4y ≤ 12 5x + 2y ≤ 10
Solve the question below using the attached excel templates with formulas for renting both slow and fast copies (labeled in the excel tabs). Question: The Decision Sciences Department is trying to determine whether to rent a slow or a fast copier. The department believes that an employee’s time is worth $15 per hour. The slow copier rents for $4 per hour, and it takes an employee an average of 10 minutes to complete copying. The fast copier rents for $15 per hour, and it takes an employee an average of six minutes to complete copying. On average, four employees per hour need to use the copying machine. (Assume the copying times and interarrival times to the copying machine are exponentially distributed.) Which machine should the department rent to minimize expected total cost per hour?
Find decision variables, objective function, constraints and non-negativity constraints An auto company manufactures cars and trucks. Each vehicle must be processed in the paint shop and body assembly shop. If the paint shop were only painting trucks, 40 per day could be painted. If the paint shop were only painting cars, 60 per day could be painted. If the body shop were only producing cars, it could process 50 per day. If the body shop were only producing trucks, it could process 50 per day. Each truck contributes $300 to profit and each car contributes $200 to profit. In addition, the auto company can produce at most 30 trucks and 20 cars. The company wants to determine the daily production schedule that will maximize the company’s profit. Formulate the LP model for the problem.