A Company Has a Goal of Calling on at Least

Multiple Choice

A company has a goal of calling on at least 400 customers a month (goal 1) , but no fewer than 260 customers a month (goal 2) . If X represents the number of customers contacted, which pair of constraints listed below is the appropriate representation in a goal programming problem?

A) X + d₁^-- d₁⁺ = 400, X + d2^- - d2⁺ = 260
B) X - d₁^-+ d₁⁺ = 400, X - d2^- - d2⁺ = 260
C) X - d₁^- + d₁⁺ = 400, X + d2^- - d2⁺ = 260
D) X + d₁⁺ - d₁⁺ = 400, X - d2^- + d2⁺ = 260