RE: diet problem disregarding cost

[Meketon, Marc]

In general, if you have variables rpos_i and rneg_i (the ith constraint), and you have:

 

[linear equation i] = rpos_i – rneg_i

 

Then (rpos_i + rneg_i) is the absolute value

 

If you then have

rpos_i + rneg_i <= z

 

z would be the maximum absolute value, and then you just minimize  z.

 

From: help-glpk-bounces+marc.meketon=oliverwyman.com@gnu.org <help-glpk-bounces+marc.meketon=oliverwyman.com@gnu.org> On Behalf Of Dušan Plavák
Sent: Wednesday, March 20, 2024 7:02 AM
To: Bjørnar Ness <bjornar.ness@gmail.com>
Cc: help-glpk@gnu.org
Subject: Re: diet problem disregarding cost

 

 

CAUTION: This email originated outside the company. Do not click links or open attachments unless you are expecting them from the sender.

 

Hi, feel free to send me an email. I did this ~ 9-10 years ago for our startup where we generate personalized nutrition plans for our clients using glpk.

 

Basically you want to build bunch of inequalities and most probably you want to have more variables not only nutrients... Depend on your exact use case.

 

On Wed, Mar 20, 2024 at 4:34 PM Bjørnar Ness <bjornar.ness@gmail.com> wrote:

Can anyone point me to an diet problem example that tries to minimize
max deviation in percentage for each nutrient, disregarding cost?

--
Bj(/)rnar

 

--

S pozdravom Dušan Plavák

---

This e-mail and any attachments may be confidential or legally privileged. If you received this message in error or are not the intended recipient, you should destroy the e-mail message and any attachments or copies, and you are prohibited from retaining, distributing, disclosing or using any information contained herein. Please inform us of the erroneous delivery by return e-mail. Thank you for your cooperation. For more information on how we use your personal data please see our Privacy Notice.