A solution which satisfies the given constraints is called  A. Scale  B. Operation  C. Feasible  D. Bounded

What is the term used to describe a solution to a Linear Programming Problem where the objective function has the maximum possible value?  A. Optimal solution  B. Infeasible solution  C. Unbounded solution  D. Feasible solution

In an Linear programming problem, the restrictions or limitations under which the objective function is to be optimized are called

A basic feasible solution is called.................. if the value of at least one basic variable is zeroans.OptimumNo solutionDegenerateNon degenerate Previous Marked for Review Next

In Linear Programming, what is the term for the set of mathematical expressions representing the constraints and the objective function?  A. Feasible region  B. Decision variables  C. Objective function  D. Mathematical model

What kind of solution do you obtain when you solve a relaxation of an integer optimization problem?Always an integer solutionA solution without considering integer constraintsA solution without any constraintsAlways a zero-one solution