/usr/share/swi-prolog/pack/clpBNR/prolog/clpBNR_toolkit.pl
All Application Manual Name SummaryHelp

  • clpBNR
    • prolog
      • clpBNR.pl -- clpBNR: Constraint Logic Programming over Continuous Domain of Reals
      • clpBNR_toolkit.pl -- clpBNR_toolkit: Toolkit of various utilities used for solving problems with clpBNR
        • iterate_until/3
        • mid_split_one/1
        • mid_split/1
        • cf_contractor/2
        • cf_solve/1
        • cf_solve/2
        • taylor_contractor/2
        • taylor_merged_contractor/2
        • lin_minimum/3
        • lin_maximum/3
        • lin_minimize/3
        • lin_maximize/3
        • local_minima/1
        • local_maxima/1
        • local_minima/2
        • local_maxima/2
 lin_minimize(+ObjF, Constraints:{}, ?Min:numeric) is semidet
Succeeds if the global minimum value of the objective function ObjF subject to Constraints can be unified with Min; otherwise fails. This behaves identically to lin_minimum/3 except variables in ObjF will be narrowed to the values used in calculating the final value of Min. Any other sets of minimizers corresponding to Min are removed from the solution space. "Universal Mines" example from the User Guide:
?- [M_Idays,M_IIdays,M_IIIdays]::integer(0,7),
lin_minimize(20*M_Idays+22*M_IIdays+18*M_IIIdays,
{4*M_Idays+6*M_IIdays+M_IIIdays>=54,4*M_Idays+4*M_IIdays+6*M_IIIdays>=65}, Min).
M_Idays = 2,
M_IIdays = 7,
M_IIIdays = 5,
Min = 284.
See also
- lin_minimum/3