Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.8, Problem 8P
Program Plan Intro
Linear
- The linear programming(LP) is also known as linear optimization.
- Consider a mathematical model, and its requirements are used to represent by the linear relationships. The linear programming is the best method to achieve the best outcome of this mathematical model. The outcomes may be, maximum profit or lower cost.
- The linear optimization is also called as mathematical optimization because, it is a special case of mathematical programming.
- More formally, the LP is a technique for optimizing linear objective function subject to constraints of linear equality and linear inequality.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
2. You have been given the equation below to solve:
f(x1, x2) = (x1 – 4)² + 5(x2)?
a) The constraints for this problem are below. Identify each constraint as either a
bound, linear equality constraint, linear inequality constraint, or nonlinear
constraint.
0zx.
• x2 20
X1 + 2x2 s 2.1
• xỉ + x s1
b) Solve the equation at the beginning of the problem using fmincon, using the
constraints in (a), and an initial guess of (-1,1) Please use the options to show 'iter-
detailed'.
Problem
Yuckdonald's is considering opening a series of restaurants along Quaint Valley Highway (QVH). The n possible locations
are along a straight line, and the distances of these locations from the start of QVH are, in miles and in increasing order. m₂.
m₂., m. where each m, is an integer (for i=1,2,,n). The constraints are as follows:
1) At each location, Yuckdonald's may open at most one restaurant. The expected profit from opening a restaurant at location
i is p.. where p > 0 and i = 1,2,...,n.
2) Any two restaurants should be at least & miles apart, where k is a positive integer.
Give an efficient algorithm to compute the maximum expected total profit subject to the given constraints.
Using Python/PuLP solve
At the beginning of month 1, Finco has $400 in cash. At the beginning of months 1, 2, 3, and 4, Finco receives certain revenues, after which it pays bills (see Table 2 below). Any money left over may be invested for one month at the interest rate of 0.1% per month; for two months at 0.5% per month; for three months at 1% per month; or for four months at 2% per month. Use linear programming to determine an investment strategy that maximizes cash on hand at the beginning of month 5. Formulate an LP to maximize Finco’s profit.
Table 2
Month
Revenues ($)
Bills ($)
1
400
600
2
800
500
3
300
500
4
300
250
Chapter 6 Solutions
Operations Research : Applications and Algorithms
Ch. 6.1 - Prob. 1PCh. 6.1 - Prob. 2PCh. 6.1 - Prob. 3PCh. 6.1 - Prob. 4PCh. 6.1 - Prob. 5PCh. 6.2 - Prob. 1PCh. 6.2 - Prob. 2PCh. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Prob. 3P
Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.4 - Prob. 1PCh. 6.4 - Prob. 2PCh. 6.4 - Prob. 3PCh. 6.4 - Prob. 4PCh. 6.4 - Prob. 5PCh. 6.4 - Prob. 6PCh. 6.4 - Prob. 7PCh. 6.4 - Prob. 8PCh. 6.4 - Prob. 9PCh. 6.4 - Prob. 10PCh. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.5 - Prob. 1PCh. 6.5 -
Find the duals of the following LPs:
Ch. 6.5 - Prob. 3PCh. 6.5 - Prob. 4PCh. 6.5 - Prob. 5PCh. 6.5 - Prob. 6PCh. 6.6 - Prob. 1PCh. 6.6 - Prob. 2PCh. 6.7 - Prob. 1PCh. 6.7 - Prob. 2PCh. 6.7 - Prob. 3PCh. 6.7 - Prob. 4PCh. 6.7 - Prob. 5PCh. 6.7 - Prob. 6PCh. 6.7 - Prob. 7PCh. 6.7 - Prob. 8PCh. 6.7 - Prob. 9PCh. 6.8 - Prob. 1PCh. 6.8 - Prob. 2PCh. 6.8 - Prob. 3PCh. 6.8 - Prob. 4PCh. 6.8 - Prob. 5PCh. 6.8 - Prob. 6PCh. 6.8 - Prob. 8PCh. 6.8 - Prob. 9PCh. 6.8 - Prob. 10PCh. 6.8 - Prob. 11PCh. 6.9 - Prob. 1PCh. 6.9 - Prob. 2PCh. 6.9 - Prob. 3PCh. 6.10 - Prob. 1PCh. 6.10 - Prob. 2PCh. 6.10 - Prob. 3PCh. 6.11 - Prob. 1PCh. 6.11 - Prob. 3PCh. 6.11 - Prob. 4PCh. 6.12 - Prob. 5PCh. 6.12 - Prob. 6PCh. 6.12 - Prob. 7PCh. 6 - Prob. 1RPCh. 6 - Prob. 2RPCh. 6 - Prob. 3RPCh. 6 - Prob. 4RPCh. 6 - Prob. 5RPCh. 6 - Prob. 6RPCh. 6 - Prob. 7RPCh. 6 - Prob. 8RPCh. 6 - Prob. 9RPCh. 6 - Prob. 10RPCh. 6 - Prob. 11RPCh. 6 - Prob. 13RPCh. 6 - Prob. 14RPCh. 6 - Prob. 15RPCh. 6 - Prob. 17RPCh. 6 - Prob. 18RPCh. 6 - Prob. 19RPCh. 6 - Prob. 20RPCh. 6 - Prob. 21RPCh. 6 - Prob. 22RPCh. 6 - Prob. 25RPCh. 6 - Prob. 29RPCh. 6 - Prob. 33RPCh. 6 - Prob. 34RPCh. 6 - Prob. 35RPCh. 6 - Prob. 36RPCh. 6 - Prob. 37RP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Q1: Reddy Mikks produces both interior and exterior paints from two raw materials, M1 and M2. The following table provides the basic data of the problem: Tons of raw material per ton of Maximum daily availability (tons) Exterior paint Interior paint Raw material, M1 6 4 24 Raw material, M2 1 2 6 Profit per ton ($1000) 5 4 The daily demand for interior paint cannot exceed that for exterior paint by more than 1 ton. Also, the maximum daily demand for interior paint is 2 tons. Reddy Mikks wants to determine the optimum (best) product mix of interior and exterior paints that maximizes the total daily profit. Give the mathematical formula of only the demand constraint? (15 mark) Note for form's designer: design the answer to be as a short paragraph. إجابتكarrow_forwardA construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below. Bulldozer/ A B C D Site Students 1 90 75 75 80 solve it 2 35 85 55 65 yourself 3 125 95 90 105 4 45 110 95 115 How should the bulldozers be moved to the construction sites in order to minimize the total distance traveled?arrow_forwardConsider the following linear programming problem: Min A + 2B s.t. A + 4B ≤ 21 2A + B ≥ 7 3A + 1.5B ≤ 21 -2A + 6B ≥ 0 A, B ≥ 0 Determine the amount of slack or surplus for each constraint. If required, round your answers to one decimal place. (1) A + 4B ≤ 21 Slack or surplus (2) 2A + B ≥ 7 Slack or surplus (3) 3A + 1.5B ≤ 21 Slack or surplus (4) -2A + 6B ≥ 0 Slack or surplusarrow_forward
- 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…arrow_forwardWill the solution be different if we use <= for the first three constraints? MIN: 21X14+ 50X15+ 40X16+ 35X24+ 30X25+ 22X25+ 55X+ 20X35+ 25X36 34 Subject to: X14+ X15+ X16 = 275,000 X24+ X25+ X26 = 400,000 X34+ X35+ X36 = 300,000 X14+ X24+ X34 < 200,000 X15+ X25+ X35 < 600,000 X16+ X26+ X36 5 225,000 X14, X15, X16, X24, X25, X26, X34, X35, X3620 %3D The solution will be the same The solution will change O We can' tellarrow_forward2. Given a worksheet that stores the top 5 students' marks. The Final marks are calculated as 25% of Term1 marks + 30% of Term2 marks and 45% of Terms3 marks. The Term3 marks entered in the worksheet are estimated marks. In order to avail the scholarship, the student must obtain final % as > 80%. 15 16 Name 17 Tarun 18 Tabassum 19 Krishanan 20 Abraham 21 Simran 22 B Term1 360 377 410 390 380 D Max Marks : 500 Term2 Term3 389 355 390 360 368 410 430 460 450 410 Final =B18*0.25 +C18*0.3+D18*0.45 391.2 394.25 426.5 408 389.9 Final % 78.24 78.85 85.3 81.6 77.98 =E17 / 500 % Estimate how much Term3 marks would be required by each student to meet this condition. For this : (i) Either use Goal Seek by taking target cell from Final % column and variable cell from Term3 column. (ii) Or use Scenario for Term3 values to get desired result in Final %.arrow_forward
- Excercise 3.1 A book salesperson living in New York needs to visit clients in Utah, Jersey, LA, and Milan within a month. The distances between these cities are given in the table in the picture. Find the optimal solution to the problem using the branch-and-bound method. Please detailed :( Thank you so mucharrow_forwardFind the minimum value as well as the point at which the minimum occurs of L = −2x₁ - 5x2 + x3 subject to the constraints x₁ + 2x₂x3 ≤ 6, x2 + 2x3 ≤ 6, 2x₂ + x3 ≤ 4, X1, X2, X3 > 0.arrow_forwardsolve the problem and table below Using the concepts of Constraint Matrix, Cyclic core. Solve the problem shown in the image using Branch and Bound algorithm. All rowshave unit costs, i.e., each prime implicant Pi, i ∈ [1, 5] has a cost of 1.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