Consider a feasible solution x to the standard form problem minimize c 0x subject to ax = b x ≥ 0, and let z = {i : xi = 0}. show that x is an optimal solution if and only if the linear programming problem minimize c 0 d subject to ad = 0 (1) di ≥ 0, i ∈ z, has an optimal cost of zero

srry idk

step-by-step explanation:

b: |12 – x| ≤ 0.25

step-by-step explanation:      

let x be the possible lengths in inches, of the ribbons jaime cut.

we have been given that jaime is cutting strips of ribbon for a project. he tries to cut each piece to be 12 inches long, but sometimes he cuts it too long or too short by as much as 0.25 inch.  

we can represent this information in an inequality as:

by the definition of absolute value function we will get,

upon combining our inequalities we will get,

therefore, the inequality   describes all the possible lengths (x), in inches, of the ribbons jaime cut.

step-by-step explanation: