00O 10O 20O 302010G53. Consider the following linear program, with a graph of the feasible region provided below the formulation.max=402) +50S.T.+2, 540≤ 3041+2 +20.104040 X₁₂What is the shadow price of the third constraint?(10, 20)(40/3, 40/3)20(20, 10)30

Shadow price is the amount of change in the objective function value if the right hand side (RHS) of…

Answered: 00 O 10 Ⓒ 20 30 20 10 GSS Consider the…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter8: Evolutionary Solver: An Alternative Optimization Procedure

Section8.5: Combinatorial Models

Problem 7P

See similar textbooks

Similar questions

This problem is based on Motorolas online method for choosing suppliers. Suppose Motorola solicits bids from five suppliers for eight products. The list price for each product and the quantity of each product that Motorola needs to purchase during the next year are listed in the file P06_93.xlsx. Each supplier has submitted the percentage discount it will offer on each product. These percentages are also listed in the file. For example, supplier 1 offers a 7% discount on product 1 and a 30% discount on product 2. The following considerations also apply: There is an administrative cost of 5000 associated with setting up a suppliers account. For example, if Motorola uses three suppliers, it incurs an administrative cost of 15,000. To ensure reliability, no supplier can supply more than 80% of Motorolas demand for any product. A supplier must supply an integer amount of each product it supplies. Develop a linear integer model to help Motorola minimize the sum of its purchase and administrative costs.
Given four decision variables A, B, C, and D, which of the following could be a linear programming problem constraint? 1A + 2B - 1C/D >=23 1A + 2A*B + 3A*B/C + 4A*B*C*D >=100 1A + 2B + 3C + 4D >=100 1A + 2B/C + 3D <=45 1A + 2B*C + 3D <=100
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…
A firm decides to invest x units of capital in project A and y units in project B. The expected return for 1 unit of investment is $400 in project A and $800 in project B. However, in order to meet the expectations of the firm’s ethical and environmental policy, the values of x and y must satisfy the constraintx2 + y2 − 4x − 6y = 67How many units of each type should the firm buy in order to maximize total return?
Consider the given LP:Maximize z = 4x1 + 6x2 + 8x3Subject to 3x1 + 2x2 + 5x3<= 30 9x1 + 2x2 + 7x3 <= 126 2x1 + 3x2 + x3<= 60 xi>= 01-Find the optimal values of Z, x1, x2, x3 by using the simplex method.3-If the RHS of the constraint 1 is 34 instead of 30, what is the new value of Z?
We have 60 meters of fence and want to fence a triangular shaped area. Please formulate an NLP (do not try to solve) that will enable us to maximize the fenced area (Hint: The area of a triangle with sides of length a, b, and c is ( s (s – a) (s – b) (s – c))1/2, where s is half the parameter of the triangle).
On the other hand, the point (x1 ϭ 15, x2 ϭ 70) is not in the feasible region, because eventhough x1 ϭ 15 and x2 ϭ 70 satisfy (2), (4), (5), and (6), they fail to satisfy (3): 15 ϩ 70is not less than or equal to 80. Any point that is not in an LPâ€™s feasible region is said tobe an infeasible point. As another example of an infeasible point, consider (x1 ϭ 40,×2 ϭ Ϫ20). Although this point satisﬁes all the constraints and the sign restriction (5), itis infeasible because it fails to satisfy the sign restriction (6), x2 Ն 0. The feasible regionfor the Giapetto problem is the set of possible production plans that Giapetto must consider in searching for the optimal production plan.DEFINITION sFor a maximization problem, an optimal solution to an LP is a point in thefeasible region with the largest objective function value. Similarly, for aminimization problem, an optimal solution is a point in the feasible…
The cost of producing x units of a product during amonth is x1/2 dollars. Show that the minimum cost methodof producing 40 units during the next two months is toproduce all 40 units during a single month. Is it possible togeneralize this result to the case where the cost of producingx units during a month is an increasing concave function?
We are going to invest $1,000 for a period of 6 months.Two potential investments are available: T-bills and gold. Ifthe $1,000 is invested in T-bills, we are certain to end the6-month period with $1,296. If we invest in gold, there is a34chance that we will end the 6-month period with $400 anda 14chance that we will end the 6-month period with $10,000.If we end up with x dollars, our utility function is given byu(x) x1/2. Should we invest in gold or T-bills?
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.)
Consider the following LP problem developed at Zafar Malik's Carbondale, Illinois, optical scanning firm: Maximize Z= 1X1+1X2 Subject to: 2X1+1X2≤100 (C1) 1X1+2X2≤100 (C2) X1,X2≥0 Part 2 The optimum solution is: Part 3 X1= ______ (round your response to two decimal places).
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.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

00 O 10 Ⓒ 20 30 20 10 GSS Consider the following linear program, with a graph of the feasibile region provided below the formulation max-402 +50 SE.. +2, 540 + ≤ 30 Of Ste+ lag 02 Faila 40 (10,20) (40/3, 40/3) (20, 10) What is the shadow price of the third constraint? 20 30 40