| |||||||||||||
Burglar - Formulating logical constraints Description This example shows how to setup a simple knapsack type problem in which an item
selection should be made maximally profitable under some weight restriction.
We first solve a pure knapsack problem. Then, we refine the constraints by
explicitly forbidding certain item combinations, thereby showing multiple ways
how to create indicator constraints.
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
BinBurglar.csproj <Project Sdk="Microsoft.NET.Sdk"> <PropertyGroup> <OutputType>Exe</OutputType> <TargetFramework>net5.0</TargetFramework> <IsPackable>false</IsPackable> <XpressExampleFiles Condition="'$(XpressExampleFiles)'==''">../../../data</XpressExampleFiles> </PropertyGroup> <ItemGroup> <PackageReference Include="FICO.Xpress.XPRSdn" Version="41.1.1" /> <!-- Version 41.1.1 or later --> </ItemGroup> </Project> | |||||||||||||
© Copyright 2024 Fair Isaac Corporation. |