Choose the best answer. The main difference between LP and NLP problems is that NLPs will have aGroup of answer choiceslinear objective function and nonlinear or linear constraints.at least one of the objective function and constraints is nonlinear.nonlinear objective function.none of the above.

What is the key difference between a maximization and a minimization linear programming problem?Group of answer choicesThe number of decision variables and constraints.The objective of the problem (what is being optimized).The solution method used to solve the problem.There is no difference between maximization and minimization LP problems.

Which of the following statements is true regarding the solution methods for solving a linear programming (LP) model?Group of answer choicesThe Simplex algorithm is not the basis of most LP optimization software.The computer solution method uses the Evolutionary algorithm.The graphical solution method can handle LP models with any number of decision variables and constraints.None of the above.

When do we use linear programming technique? Explain mathematical formulation of Linear programming Problem (LPP).

The Excel Solver solution strategy for NLP problems uses a particular algorithm. Which algorithm is it?Group of answer choicesSimplex LPGRG NonlinearEvolutionaryNone of the above

All linear programming problems have all of the following properties EXCEPTGroup of answer choicesa linear objective function that is to be maximized or minimized.a set of linear constraints.decision variables that are continuous.a non-linear objective function that is to be maximized or minimized.