Question

only 2

PROBLEM SET 3.5A *1. Consider the graphical solution space in Figure 3.8. Suppose that the simplex iterations start at A and that the optimum solution occurs at D. Further, assume that the objective function is defined such that at A, x, enters the solution first. (a) Identify (on the graph) the corner points that define the simplex method path to the optimum point. (b) Determine the maximum possible number of simplex iterations needed to reach the optimum solution, assuming no cycling. 2. Consider the following LP: Maximize 2 = 3x + 2x2 subject to *2 58 4x, + 3x2 = 12 4x + x2 5 8 X.X220 (a) Show that the associated simplex iterations are temporarily degenerate (you may use TORA for convenience). (b) Verify the result by solving the problem graphically (TORA's Graphic module can be used here) 4X1

Answer 1

SOLU 710w >> MAXIMIZE Z = 3x, + 2 X2 SUBJECT TO Чx, — X, KR Чх, + 3x, K|2 ЧX, + X, KR х, эх, хоо 3 ZILIKUW 2- Ох,+LX. SUBJECT 8 Их, — X, +X3 Чx, +3х, Чх, + x, hxt C = 3 XI Sx + 리 8 2 7- о - с Х х Чx hХ # 1 х 4 о ST COM 2 Х;> <a 3 о - Xu ч 3 Х Х X5 2 ч — 7 -3 - 2 О о * с X, * Х. hХ EX Х, су X4 эх- х.. X.57 Хэ - — - о h — Xy о Ч Syl 1 о 2 1 ч 2 О о п.

X, t X₂ b X2 b X5 Xu X 2 78 1 16 0 u Xy u -2 O - 아 X- 2 С - 5 2 - IZ o 6 -578 0 1/8 Xi X2 X3 X5 X Ху - Ś - 0 318 3/ X - 4 2 б - -1/2 2 Xo 2 17 이 o 518 26, 2270 Z st ? X - 13, 2,4 12,4,0,0) BORRY I DO NOT KNOW YORA'S 70°NOT HAVE Z 17 2 MAXIMUM - THANK YOU