Question: Data Analysis and Decision Modeling 1. A constraint which cannot be violated is called a a. binding constraint b. hard constraint. c. definite constraint. d.

Data Analysis and Decision Modeling

Data Analysis and Decision Modeling 1. A

1. A constraint which cannot be violated is called a a. binding constraint b. hard constraint. c. definite constraint. d. required constraint. 2. A constraint which represents a target value for a problem is called a a. fuzzy constraint. b. vague constraint. c. preference constraint d. soft constraint 3. Goal programming differs from linear programming or integer linear programming is that a. goal programming provides for multiple objectives. b.goal programming excludes hard constraints. c. with goal programming we iterate until an acceptable solution is obtained. d. goal programming requires fewer variables. 4. Decision-making problems which can be stated as a collection of desired objectives are known as what type of problem? a. A non-linear programming problem. b. An unconstrained programming problem. c. A goal programming problem. d. An integer programming

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!