It has been suggested that at each iteration of the simplex algorithm, the entering variable should be (in a maximizationproblem) the variable that would bring about the greatest increase in the objective function. Although this usually results infewer pivots than the rule of entering the most negative row 0 entry, the greatest increase rule is hardly ever used. Why not?

It has been suggested that at each iteration of the simplex algorithm, the entering variable should be (in a maximizationproblem) the variable that would bring about the greatest increase in the objective function. Although this usually results infewer pivots than the rule of entering the most negative row 0 entry, the greatest increase rule is hardly ever used. Why not?

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter8: Evolutionary Solver: An Alternative Optimization Procedure

Section: Chapter Questions

Problem 38P

See similar textbooks

Similar questions

Based on Grossman and Hart (1983). A salesperson for Fuller Brush has three options: (1) quit, (2) put forth a low level of effort, or (3) put forth a high level of effort. Suppose for simplicity that each salesperson will sell 0, 5000, or 50,000 worth of brushes. The probability of each sales amount depends on the effort level as described in the file P07_71.xlsx. If a salesperson is paid w dollars, he or she regards this as a benefit of w1/2 units. In addition, low effort costs the salesperson 0 benefit units, whereas high effort costs 50 benefit units. If a salesperson were to quit Fuller and work elsewhere, he or she could earn a benefit of 20 units. Fuller wants all salespeople to put forth a high level of effort. The question is how to minimize the cost of encouraging them to do so. The company cannot observe the level of effort put forth by a salesperson, but it can observe the size of his or her sales. Thus, the wage paid to the salesperson is completely determined by the size of the sale. This means that Fuller must determine w0, the wage paid for sales of 0; w5000, the wage paid for sales of 5000; and w50,000, the wage paid for sales of 50,000. These wages must be set so that the salespeople value the expected benefit from high effort more than quitting and more than low effort. Determine how to minimize the expected cost of ensuring that all salespeople put forth high effort. (This problem is an example of agency theory.)
In Problem 11 from the previous section, we stated that the damage amount is normally distributed. Suppose instead that the damage amount is triangularly distributed with parameters 500, 1500, and 7000. That is, the damage in an accident can be as low as 500 or as high as 7000, the most likely value is 1500, and there is definite skewness to the right. (It turns out, as you can verify in @RISK, that the mean of this distribution is 3000, the same as in Problem 11.) Use @RISK to simulate the amount you pay for damage. Run 5000 iterations. Then answer the following questions. In each case, explain how the indicated event would occur. a. What is the probability that you pay a positive amount but less than 750? b. What is the probability that you pay more than 600? c. What is the probability that you pay exactly 1000 (the deductible)?
If x1-x4 are binary decision variables denoting choosing or not choosing of projects 1-4 for investing, The constraint x1− x2= 0 implies that if project 1 is selected, project 2 cannot be. True False
TRUE OR FALSE In the simplex minimization method, optimality is signaled by the presence of all positive values in the Cj-Zj row
Vladimir Ulanowsky is playing Keith Smithson in atwo-game chess match. Winning a game scores 1 match 19.4 Further Examples of Probabilistic Dynamic Programming Formulations 1029 point, and drawing a game scores 12match point. After thetwo games are played, the player with more match points isdeclared the champion. If the two players are tied after twogames, they continue playing until someone wins a game(the winner of that game will be the champion). Duringeach game, Ulanowsky can play one of two ways: boldly orconservatively. If he plays boldly, he has a 45% chance ofwinning the game and a 55% chance of losing the game. Ifhe plays conservatively, he has a 90% chance of drawing thegame and a 10% chance of losing the game. Ulanowsky’sgoal is to maximize his probability of winning the match.Use dynamic programming to help him accomplish thisgoal. If this problem is solved correctly, even thoughUlanowsky is the inferior player, his chance of winning the match is over 12. Explain this…
This condition arises when there is a tie in the values used to determine which variable will enter the solution next. a. infeasibility b. unboundedness c. multiple optimal solutions d. degeneracy
Which of the following is the optimal value of the objective function for the LP model in this problem? Minimize z=4x + 8y Subject to: x+1.6y>=45 2x+0.5y>=40 X+y<=40 XY>=0 a.220 b.160 c.240 d.200
A market analyst working for a small appliance manufacturer finds that if the firm produces and sells x blenders annually, a model for the total profit (in dollars) is P(x) = 8x + 0.3x2 − 0.001x3 − 372. Graph the function P in an appropriate viewing rectangle, and use the graph to answer the following questions. (a) When just a few blenders are manufactured, the firm loses money (profit is negative). (For example, P(10) = −263, so the firm loses $263.00 if it produces and sells only 10 blenders.) How many blenders must the firm produce to break even? (Round your answer to the nearest whole number.) blenders(b) Does profit increase indefinitely as more blenders are produced and sold? YesNo If not, what is the largest possible profit the firm could have? (If profit increases indefinitely, enter your answer as ∞. Otherwise, round your answer to the nearest cent.)
True or False 1. Given three corner points A, B, and C of a linear programming problem, if A is adjacent to B and B is adjacent to C, then A can be determined from C by interchanging exactly two basic and two nonbasic variables. 2. For a set of primary and dual solutions to be feasible, the objective function value of the primary (Z) can never exceed that of the dual (W) no matter which problem is to maximize and which is to minimize. 3. If the current iteration is degenerate, the next iteration will also be degenerate. 4. The optimal (dual) primary solution can be obtained from the dual (primary) optimal tableau.
TRUE OR FALSE In a simplex maximization slack variable is added to convert the objective function to equation.
what will happen if the right hand side value of a constraint in two variable linear programming problems is changed? a. optimal measure of performance may change b. parallel shift must be made in the graph of that constraint c. optimal valued for one or more of the decision variables may change d. all of the above e. none of the above
In linear programming problems, you always need to include a(n) ___________ constraint, to ensure that all decision variables are greater than or equal to 0. Group of answer choices positive time production non-negativity