answersLogoWhite

0

One.

To be a (non-trivial) linear programming problem both the objective function and the constraints must be linear.

If there were no constraints then the objective function could be made arbitrarily large or arbitrarily small. (Think of a line in two-space.)

By adding one constraint the objective function's value can be limited to a finite value.

User Avatar

Wiki User

8y ago

Still curious? Ask our experts.

Chat with our AI personalities

EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
RossRoss
Every question is just a happy little opportunity.
Chat with Ross
More answers

One. Since otherwise it is a system of simultaneous linear equations.

User Avatar

Wiki User

8y ago
User Avatar

The examples I have seen usually have two or more constraints; I guess with a single constraint the program would have a trivial solution that doesn't require linear programming.

User Avatar

Wiki User

8y ago
User Avatar

Add your answer:

Earn +20 pts
Q: What is the minimum number of constraints a linear programming problem can have?
Write your answer...
Submit
Still have questions?
magnify glass
imp