(adsbygoogle = window.adsbygoogle || []).push({}); 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 any one 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.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Linear Programming - satisfaction only at least one constraint

Loading...

Similar Threads - Linear Programming satisfaction | Date |
---|---|

I Linear Program:Multiple Optima for multivariable Obj. Func.? | Oct 4, 2017 |

I Linear programming problem | May 13, 2016 |

LP objective function with unknown parameters | Nov 9, 2015 |

Linear programming question | Apr 24, 2014 |

Linear Programming - Separation of points | Dec 11, 2011 |

**Physics Forums - The Fusion of Science and Community**