1) If conditions require that all decision variables must have an integer solution, then the class of problem described is an integer programming proble

1) If conditions require that all decision variables must have an integer solution, then the class of problem described is an integer programming problem.

2) An integer programming solution can never produce a greater profit objective than the LP solution to the same problem.

3) 0-1 integer programming might be applicable to selecting the best gymnastics team to represent a country from among all identified teams.

4) Nonlinear programming is the case in which objectives and/or constraints are nonlinear.

5) The following objective function is nonlinear: Max 5X + (1/8)Y – Z.

6) In goal programming, if all the goals are achieved, then the value of the objective function will always be zero.

7) Unfortunately, multiple goals in goal programming are not able to be prioritized and solved.

8) The following objective function is nonlinear: Max 5X – 8YZ.

9) Goal programming permits multiple objectives to be satisfied.

10) The constraint X1 + X2 ? 1 with 0 -1 integer programming allows for either X1 or X2 to be a part of the optimal solution, but not both.

11) Requiring an integer solution to a linear programming problem decreases the size of the feasible region.

12) The transportation problem is a good example of a pure integer programming problem.

13) The three types of integer programs are: pure integer programming, impure integer programming, and 0-1 integer programming.

14) When solving very large integer programming problems, we sometimes have to settle for a “good,” not necessarily optimal, answer.

15) Quadratic programming contains squared terms in the constraints.

16) In goal programming, our goal is to drive the deviational variables in the objective function as close to zero as possible.

17) There is no general method for solving all nonlinear problems.

18) A 0-1 programming representation could be used to assign sections of a course to specific classrooms.

19) In goal programming, the deviational variables have the same objective function coefficients as the surplus and slack variables in a normal linear program.

Answer: FALSE

Diff: 2

Topic: GOAL PROGRAMMING

20) Unfortunately, goal programming, while able to handle multiple objectives, is unable to prioritize these objectives.

21) A model containing a linear objective function and linear constraints but requiring that one or more of the decision variables take on an integer value in the final solution is called

A) a goal programming problem.

B) an integer programming problem.

C) a nonlinear programming problem.

D) a multiple objective LP problem.

E) a branch-and-bound programming problem.

22) Assignment problems solved previously by linear programming techniques are also examples of

A) pure-integer programming problems.

Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.