Question 1 I am solving a minimization LP using simpler method. At a given iteration, the basic variables are 21, 22, 2s
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Question 1 I am solving a minimization LP using simpler method. At a given iteration, the basic variables are 21, 22, 2s
Question 1 I am solving a minimization LP using simpler method. At a given iteration, the basic variables are 21, 22, 2s, and 27 while the non-basic variables are 23, 14, and 26. Let AB be the matrix of constraint coefficients corresponding to the basic variables, b be the right-hand-side vector, and A be the column of constraint coefficients corresponding to the jth variable. Suppose that 1 0 t 2 4 0 4 S Ag! AgA 2 p 9 ABA and Az A [] u 0 10 1. Suppose that the reduced costs of 13, I4 and 26 are -3, 1 and -5, respectively. Use Bland's rule for pivoting. (a) (2 pt) State the entering variable. (b) (2 pt) State conditions on p, q, r, s, t, u (you may give conditions on a subset of the param- eters) such that I is the leaving variable. (c) (2 pt) Is it possible for 2 to be leaving variable? If no, why? 22 (d) (2 pt) State conditions on p, q, r, s, t, u (you may give conditions on a subset of the param- eters) such that is the leaving variable. (e) (1 pt) State conditions on p, q, r, s, t, u (you may give conditions on a subset of the param- eters) such that is is the leaving variable.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!