The text book is, "Algorithms by Dasgupta, Papadimitriou, and Vazirani" . You can find the free copy of the book online, just search it. Here is the text book link http://www.cse.iitd.ernet.in/~naveen/courses/CSL630/all.pdf

2. (5 points) Converging Linear Programs to Stendard Garage Forms It is often convenient to represent linear programs in 'standard forms', which of constraints. One example of such a form is on page 210 of text books define such forms differently. have fewer types the text book, and sadly, different For this problem, we consider a form of linear programs which we'll term the garage form. Fo variables fa1, 72, . . .,^nj, the garage form has: maximize c11 2+. +Cn.n subject to 1 1,22ann S bi cj20 for all 1 jn Specifically every variable is non-negative, and every constraint is of the form of Convert the linear program: minimize a 10c subject to a + 5)- 10 5b-4d2-2 the garage form as specified above. Note that any number z can be written as the difference of two non-negative numbers. That is, for any z there are and z-such that and ,2_ > 0