Question: 6. (4 points) Consider a variant of linear programming where in addition to original linear constraints, we are aloo allowed to have constraints of the
6. (4 points) Consider a variant of linear programming where in addition to original linear constraints, we are aloo allowed to have constraints of the form a1x1++anxn=b where. a1,,an,b are numbers, and x1,,xn are variables. Let us call such a program, an Absolutevalue Program. For example, the following is an Absolute-value Program. max3x4y+z+3w5xz+3w2xy+2wx+y2wx+5ywyzw67=3=10000 Prove that Absolute-value Programming is NP-complete More precisely, prove that the following problem is NP-complete: - Input: A maximization Absolute-value Program and an integer A. - Question: Does the optimal solution to the program lave coit at leart k
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
