Solve the following Linear Programming Max z = 2X1 + 3X2 St, 3X1 + 2X2 < 12 X1+ 2X2<10 X1, X22 0 12 20 15.5 5.15 O O

You know you have 5 pairs of sock in the laundry basket. You want a pair of matched socks but can’t see any socks. You reach into the basket and pull out socks. What’s the maximum of number of socks that you will have to pull out in order to guarantee that you will get a matching pair of socks?

Solve the following optimization model using Excel Solver. Upload the final excel file. min 2x2 + 5xz+8zy ² s.t. Attach File 8x + 16y+21z2 400 3x + 5y + 8z2 160 4z² + 5xy ≤ 600 x,y,z 20 Browse Local Files Browse Content Collection

Please use R-programming. Please provide the source code that makes the program run, and then screenshot the output.  Question: Suppose a parallel reliability system consists of cables of wires holding a bridge andthat one of them must have at least 90 wires. If the reliability of a single wire is 0.25 what is a minimal number of wires counted from 90 (or more) should that cable have in order to maintain the reliability of the system to at least 0.95?