Linear Programming for Inequalities, Lecture notes of Linear Programming

Download Linear Programming for Inequalities and more Lecture notes Linear Programming in PDF only on Docsity!

a a aig KLINFAR PROGRAMMING No. Date. A local boutique piduced two designs of ditsser A and B and has the following maknals available = [8 Square focters . Of cotton, 20 Square + ines oe silk, and. § Square meters. of wool. Design A _tequires the following : 4 square metas of cotton, 2 squate_metus of sik, Gnd 4 Vguare meter of. ven}. bign A.requizs he fleuing2 equates oft cand 4 Square_metos of lk: If Design A sells ar P1200 and Design B for 1,00, how many of “each garment thould the boutique Prdua tr obtain te maximum amount of money? Y= Design A y= Design B Materials [Design A(x) | Design 8 CY) | Available 3 botton 3 Vv 12 Silk rs 4 20 Woo] 4 ) Uv: be entit 1,200 1,400 ey Maximite P= [200x°+ lbooy Amber — Notes — ics] CamScanner No. Date. 2 3x + dy £18 ~ wtton 2x fd 6:20 sh MMS op se tut bes ES Xx & is 2 -bWool- ie : X210;1 X2O> 2 Non neg atiity enstinl £ oxb2y= 1B os Dut Ay e'20 eae lee X= Os deb ye oe cs YE (oq). y= 5(0,5) © let y= 0 let NEOom viol oda x= maT X= 10(10,0)-: Date. Tht decision is f creak 4 Design A Gowoss andr 3 design B gowns _in order to maximix Sales X= 4 \*3 P= 79, 6d0 ” 3X $2yL19 2x + dy 426 = 3) 203) £ ig _2(4) +43) £20 e 2+ © £ [8 8+ |2 £ | Fig é ial 20 £20 4