Linear Program:Multiple Optima for multivariable Obj. Func.?

Click For Summary
SUMMARY

The discussion focuses on the conditions under which multiple optimal solutions exist for multivariable objective functions in linear programming. Specifically, it establishes that when the objective function, represented as ∑_{k=1}^n a_kx_k, has an equal slope to a non-redundant constraint, such as ∑_{k=1}^n a_kx_k ≤ b or ∑_{k=1}^n a_kx_k ≥ b, there can be infinitely many solutions. This principle applies to both two-variable and n-variable scenarios, confirming the relationship between the slopes of the objective function and constraints.

PREREQUISITES
  • Understanding of linear programming concepts
  • Familiarity with objective functions and constraints
  • Knowledge of slope and feasible regions in graphical representation
  • Basic algebra involving summation notation
NEXT STEPS
  • Study the graphical interpretation of linear programming solutions
  • Learn about the Simplex method for solving linear programming problems
  • Explore duality in linear programming to understand optimality conditions
  • Investigate sensitivity analysis in linear programming
USEFUL FOR

Students and professionals in operations research, mathematicians, and anyone involved in optimization problems in economics or engineering will benefit from this discussion.

StevenJacobs990
Messages
16
Reaction score
0
I know there can be an infinite number of solutions when the objective function with 2 variables has an equal slope as a constraint's slope (assuming the constraint is affecting the feasible region and not a redundant constraint).

How can you know there are multiple optimal solutions for multi-variable object function?
 
Physics news on Phys.org
In two variables the condition you describe can occur when the objective function is ##a_1x_1+a_2x_2## and one of the non-redundant constraints can be written as ##a_1x_1+a_2x_2\leq b## or ##a_1x_1+a_2x_2\geq b##.

Similarly, with ##n## variables. if the objective function is ##\sum_{k=1}^n a_kx_k## and one of the non-redundant constraints can be written as ##\sum_{k=1}^n a_kx_k\leq b## or ##\sum_{k=1}^n a_kx_k\geq b## then there can be infinitely many solutions.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 13 ·
Replies
13
Views
5K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K