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
Expert Solution & Answer
Chapter 4, Problem 17RP
Explanation of Solution
Explanation:
The table for a maximization problem is given below.
z | x1 | x2 | x3 | x4 | x5 | ... |
Explanation of Solution
a.
Explanation:
- For the current solution to be optimal, all the non basic variables in row zero have non negative coefficients, so this implies, -c≥0...
Explanation of Solution
b.
Explanation:
- The current solution is optimal and there are alternative optimal solutions, the conditions on the unknown that makes this statement true are b≥0 and c=0.
- This is because if x1 has a zero coefficient in the optimal tableau’s row 0, then the pivot that enters x1 into the basis does not change row zero.
- So all the variables in row zero have positive coefficients...
Explanation of Solution
c.
Explanation:
- An unbounded LP for a maximization problem occurs when a variable with a negative coefficient in row zero has non positive coefficient in each constraint.
- So an LP is unbounded if there exists points in feasible region for which z assumes arbitrarily large values for a maximization problem and arbitrarily small values for a minimization problem...
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…
Solve the following problem and find the optimal solution.
A 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?
Chapter 4 Solutions
Operations Research : Applications and Algorithms
Ch. 4.1 - Prob. 1PCh. 4.1 - Prob. 2PCh. 4.1 - Prob. 3PCh. 4.4 - Prob. 1PCh. 4.4 - Prob. 2PCh. 4.4 - Prob. 3PCh. 4.4 - Prob. 4PCh. 4.4 - Prob. 5PCh. 4.4 - Prob. 6PCh. 4.4 - Prob. 7P
Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
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
- If it is possible to create an optimal solution for a problem by constructing optimal solutions for its subproblems, then the problem possesses the corresponding property. a) Subproblems which overlap b) Optimal substructure c) Memorization d) Greedyarrow_forwardMaximum weight = 20The above problem is a 0/1 Knapsack problem. Here there are 7 different objects labelled from A to G. The objective of this problem is to carry the different objects in your bag in such a way such that the profit is maximized. But you have to make sure that your bag does not exceed the maximum weight i.e. the maximum weight that this bag can carry is less than or equal to 15. Remember you can carry an object exactly once. Now it is your job to use Genetic Algorithm to solve this problem. 1. Encode the problem and create an initial population of 4 different chromosomes 2. Think of an appropriate fitness function to this problem and give proper justification. 3. Use the fitness function to calculate the fitness level of all the chromosomes in your population 4. Perform natural selection and select the two fittest chromosomes 5. Use the parents from (4) and perform crossover to get 2 offspring 6. Perform mutation and check the fitness of the final offspring. Comment…arrow_forwardA circus is planning a tower act in which individuals stand on top of one another's shoulders. Each individual must be both shorter and lighter than the person below him or her for practical and aesthetic reasons. Write a way to determine the maximum feasible number of people in such a tower given the heights and weights of each individual in the circus.arrow_forward
- K = 0, L = 18 Write and solve the following linear program using lingo, take screen shots of your model as well as the reports and the optimal solution. Clearly show the optimal solution.NB:K=the second digit of your student number;L=sum of the digits of your student number, For example if your student number is 17400159 thenK=7andL=1+7+4+0+0+1+5+9=27!!!! SAVE YOUR FILE BY YOUR STUDENT NUMBER!!!!minz=t∈T∑(AtYt+PtXt)+k∈K∑(HkUk+BkVk)s.t.Uk+Vk=50∀k∈KXt−CtYt<=0∀t∈Tk∈K∑Vk≥80t∈T∑Xt≥t∈T∑DtXt>=0∀t∈TYt∈{0,1}∀t∈TUk>=0∀k∈KVk>=0∀k∈KThe sets parameters and data are as follows: \[ \begin{array}{l} \mathrm{T}=\{1,2,3,4\} \\ \mathrm{K}=\{0,1,2,3,4\} \\ \mathrm{A}=\{5000,7000,8000,4000\} \\ \mathrm{D}=\{250,65,500,400\} \\ \mathrm{C}=\{500,900,700,800\} \\ \mathrm{P}=\{20, \mathrm{~L}, 25,20\} \\ \mathrm{H}=\{5,3,2, \mathrm{~K}, 9\} \\ \mathrm{B}=\{8,5,4,7,6\} \end{array} \]arrow_forwardGive the given linear program in following: Identify the decision variables, Objective function, Set of Constraints, and Parameters. For the Graphical Solutions: Graph the Constraints, Obtain the Corner-Points of the Feasible Solution and Get the Optimal Solution. Inside the store there are two types of products One is in a variety of products and the other is bakery supplies. Of course in a store, in order to make a profit, a budget is needed for the products to be sold: For variety they spend up to Php 6,000 in a week and for bakery supplies, they no longer have problems because consignment is in their agreement to be able to sell. For bakery supplies, My parents sell Php 315,000 and they earn Php 31,500 in 3 months. And in the main variety product; They sell Php 48,000 they earn Php 18,000 in 4 months. For other equipment such as Plastic Bags, Water and Electricity they spend Php 3,230 in a month which reduces the income. On the day of December 19, the store will be temporarily…arrow_forwardPlease explain! Dynamic Programming can be used to solve numerous real-life optimization problems. Consider these six problems.Five of these six problems have elegant and efficient solutions using Dynamic Programming, but one of these problems does not. Which of these six problems cannot be solved using Dynamic Programming? Choice 1 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to maximize your profit Choice 2 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to minimize your profit Choice 3 of 6: Given a graph, determine the shortest path from the start vertex to the end vertex without repeating any edges Choice 4 of 6: Given a graph, determine the longest path from the start vertex to the end vertex without repeating any edges Choice 5 of 6: Given a sequence of integers, determine the longest increasing subsequence of that sequence Choice 6 of 6: Given a sequence of integers,…arrow_forward
- A person is cutting a long board of wood into different length of pieces. Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut's lengths and their equivalent prices. Input: board length = 4 Length [] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ 1= [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: Cut Profit 4 1,3 2,2 3,1 1,1,2 1,2,1 2,1,1 1,1,1,1 10 (2+8) = 10 (6+6) = 12 (8+2) = 10 (2+2+6) = 10 (2+6+2) = 10 (6+2+2) = 10 (2+2+2+2) = 8 As noted the best cut is two pieces of length 2 each to gain revenue of 6+ 6 = 12 To answer question 1, you need to do the following: 1. Write an algorithm to find the optimal cuts in order to increase the person income's 2. Implement the…arrow_forwardA person is cutting a long board of wood into different length of pieces . Each cutting has fixed width 2 cm lengths. Given that each cutting with different length has a different price, Now, we are required to help this person to find the optimal cuts in order to increase his income. Consider following example showing different cut’s lengths and their equivalent prices. Input: board length = 4 Length [ ] = [1, 2, 3, 4, 5, 6, 7, 8] Price [ ] = [2, 6, 8, 10, 14, 17, 19, 20] Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12 [Explanation: the possible cuts and profit of each is as follows: As noted the best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12arrow_forward2 The Optimal Order paper company has received orders for four different groups of publications. The following orders have been placed. 8 rolls of 2 ft. paper at $2.50 per roll 6 rolls of 2.5 ft. paper at $3.10 per roll 5 rolls of 4 ft. paper at $5.25 per roll 4 rolls of 3 ft. paper at $4.40 per roll Due to heavy demand on the printing process, the paper company only has 13 ft. of paper from which to fill these orders. If partial orders (1 roll,2 rolls,3 rolls, etc.) can be filled, which orders and how many of each should be filled to maximize total profit? Use Dynamic Programming to answer the question and show stages 4 and 3 only.arrow_forward
- Kelvin and Fahrenheit have gotten bored of eating ice cubes, so now they have decided to eat candies instead. Kelvin has X hot candies, and Fahrenheit has Y cold candies. Kelvin and Fahrenheit always want the split of candies to be as fair as possible. The problem is, Kelvin only wants hot candies and Fahrenheit only wants cold candies. Here comes Equilibrium to the rescue! Equilibrium bought an infinite number of candy packs. There are two types of packs: Packs containing exactly C hot candies and Packs containing exactly D cold candies. Equilibrium wants to give some hot candy packs to Kelvin and some cold candy packs to Fahrenheit in such a way that the absolute difference between the number of candies they have is minimized. You are assigned to develop a JAVA code that finds out the minimum absolute difference. Test Case Result 1 1 1222arrow_forwardThe public utilities commission has decided that the electric company overcharged its customers for two months last year. To make up the difference to the customers, the commission orders the company to decrease each of the next month’s bills by 10%. The city also levies a 3%utility tax, which is to be applied to the bill before it is discounted. Also, the10% discount does not apply to the utility tax. Assume electricity costs $0.16per kilowatt-hour. Write a program to compute the next month’s electricity bill given the number of kilowatt-hours consumed as inputarrow_forwardThe tableau is not optimal for either maximization or a minimization problem. Thus, when a nonbasic variable enters the solution it can either increase or decrease Z or leave it unchanged, depending on the parameters of the entering nonbasic variable. Basic Z 0 -5 0 4 -1 -10 0 0 598 0 3 0 -2 -3 -1 5 1 12 0 1 1 3 1 0 3 0 6 1 -1 0 0 6 -4 0 0 0 Categorize the variables as basic and nonbasic and provide the current values of all the variables. AP [8] Assuming that the problem is of the maximization type, identify the nonbasic variables that have the potential to improve the value of If each such variable enters the basic solution, determine the associated leaving…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