# An optimal solution to a linear programming problem must lie?

31 views

## Problem:

Can anyone help with right solution?

An optimal solution to a linear programming problem MUST lie?

A. somewhere outside of the feasible region.
B. somewhere on the line between two corner points.
C. at the intersection of at least two constraints.
D. somewhere in the interior of the feasible region.

## Solution:

The correct answer is: at the intersection of at least two constraints.

Definition:
A linear programming problem (LP) is an optimization problem for which:
1. We attempt to maximize (or minimize) a linear function of the decision variables. (objective function)
2. The values of the decision variables must satisfy a set of constraints, each of which must be a linear inequality or linear equality.
3. A sign restriction on each variable.
For each variable xi the sign restriction can either say
(a) xi ≥ 0,
(b) xi ≤ 0,
(c) xi unrestricted (urs)

## Solution:

The Correct Answer of this question is
C. at the intersection of at least two constraints.

### Explanation:

Linear programming (LP, also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization).

## Related questions

19 views
Problem: In linear programming, a solution that does not simultaneously satisfy all constraints is called an? A. illogical solution. B. intermediate solution. C. impossible solution. D. infeasible solution.
18 views
Problem: What are the four requirements of a linear programming​ problem? A. an​ objective, constraints,​ alternatives, and conditional values B. an​ objective, constraints,​ alternatives, and linearity C. sources, destinations,alternatives, and linearity D. alternatives, states of​ nature, conditional​ values, and probabilities