answersLogoWhite

0


Best Answer

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

7y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

7y ago

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

This answer is:
User Avatar

User Avatar

Wiki User

7y ago

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.

This answer is:
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
Related questions

What are the scope of linear programming?

Linear programming can be used to solve problems requiring the optimisation (maximum or minimum) of a linear objective function when the variables are subject to a linear constraints.


What is the theoretical limit on the number of constraints on a linear programming problem?

There is no limit.


What is non linear programming problem?

It is a programming problem in which the objective function is to be optimised subject to a set of constraints. At least one of the constraints or the objective functions must be non-linear in at least one of the variables.


To solve a linear programming problem with thousands of variables and constraints?

a mainframe computer is required


What are the components of linear programming?

A linear objective function and linear constraints.


What are the components of programming?

A linear objective function and linear constraints.


What is optimal feasible solution?

It is usually the answer in linear programming. The objective of linear programming is to find the optimum solution (maximum or minimum) of an objective function under a number of linear constraints. The constraints should generate a feasible region: a region in which all the constraints are satisfied. The optimal feasible solution is a solution that lies in this region and also optimises the obective function.


What do you understand by linear programming problem?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


What do you understand by linear programming?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


What are the components of linear programming models?

The objective function and the constraints.


How do you find constraints in Linear Programming?

first find out if it is congruent if it isn't congruent you can find the constraints


What is the importance of linear programming?

It allows you to maximise or minimise objective functions, subject to constraints that are linear.