In computability theory, a problem is said to be computable if: A Any kind of solution can be found B 'The problem is a mathematical problem C The problem has a feasible solution D The problem is a classical computing probleT

A firm has prepared the following binary integer program to evaluate a number of potential new capital projects. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital.   Max 100x1 + 120x2 + 90x3 + 135x4 s.t. 150x1 + 200x2 + 225x3 + 175x4 ≤ 500 {Constraint 1} x1 + x2 + x3 + x4 ≥ 2 {Constraint 2} x2 + x4 ≤ 1 {Constraint 3} x2 + x3 ≥ 1 {Constraint 4} x1 = x4 {Constraint 5}   Which of the constraints ensures that at least two of the potential projects will be selected? Constraint 4 Constraint 5 Constraint 1 Constraint 3 Constraint 2

Finite Math -

Problem 12-27 (Algorithmic) Andalus Furniture Company has two manufacturing plants, one at Aynor and another at Spartanburg. The cost in dollars of producing a kitchen chair at each of the two plants is given here. Aynor: Cost = 80Q1 +5Q1² + 92 Spartanburg: Cost = 20Q2 +2.502² + 159 Where Q1 = number of chairs produced at Aynor Q2 = number of chairs produced at Spartanburg Andalus needs to manufacture a total of 30 kitchen chairs to meet an order just received. How many chairs should be made at Aynor and how many should be made at Spartanburg in order to minimize total production cost? When required, round your answers to the nearest dollar. The optimal solution is to produce and $ chairs at Aynor for a cost of $ chairs at Spartanburg for a cost of $ The total cost is