- #1
wavingerwin
- 98
- 0
Linear Programming - satisfaction of only at least one constraint
Hi
Is there a form of relaxation/modification of an LP of the form
[tex]\text{min }\;\;f^\mathsf{T}x\\\mathbf{A}x\leq b[/tex]
such that if only anyone of the constraints is satisfied, then the solution ##x## is regarded as feasible?
Here ##\mathbf{A}x\leq b## represents a row of linear constraints.
Gratitudes in advance.
Hi
Is there a form of relaxation/modification of an LP of the form
[tex]\text{min }\;\;f^\mathsf{T}x\\\mathbf{A}x\leq b[/tex]
such that if only anyone of the constraints is satisfied, then the solution ##x## is regarded as feasible?
Here ##\mathbf{A}x\leq b## represents a row of linear constraints.
Gratitudes in advance.
Last edited: