| |||||||||||||
Solving a non-linear problem by recursion Description A non-linear problem (quadratic terms in the constraints) is
solved via successive linear
programming (SLP, also referred to as recursion). The constraint coefficients are changed iteratively.
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
RecursiveFinancialPlanning.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. |