Welcome to MSDN Blogs Sign in | Join | Help

Browse by Tags

All Tags » C#   (RSS)

Using Solver Foundation's Unconstrained Nonlinear Solver

Posted Thursday, October 15, 2009 3:48 PM by Nathan Brixius
Hey, did you know that Solver Foundation can solve unconstrained nonlinear optimization problems? Yep, it's true. Few people know about it because 1) we haven't talked about it too much and 2) it is not accessible from the SFS (which means you can't use Read More...
0 Comments

Solver Foundation 2.0 Preview: Second Order Conic Programming

Posted Thursday, October 01, 2009 9:32 PM by Nathan Brixius
A couple of weeks ago I wrote about one of our big features for Solver Foundation 2.0: stochastic programming . In this post I want to talk about a new solver for 2.0: an interior-point solver for Second Order Conic Programming (SOCP). Second Order Conic Read More...
1 Comments

Using the Solver Foundation Interior Point Solver

Posted Thursday, September 24, 2009 2:24 PM by Nathan Brixius
I've had a few requests on this topic, so I thought I would give a simple example of how to write code against Solver Foundation's interior point solver. If you are new to Solver Foundation, be warned that this is something of an "advanced topic". The Read More...
0 Comments

Quadratic Assignment Problems: solution enumeration

Posted Monday, July 27, 2009 9:53 AM by Nathan Brixius
In the last few posts we have given code for computing the Gilmore Lawler bound for quadratic assignment problems, and described two different branching techniques . In this post we show how to enumerate solutions of a small QAP. The possible solutions Read More...
0 Comments

Quadratic Assignment Problems: strong and weak branching

Posted Sunday, July 19, 2009 7:19 PM by Nathan Brixius
Let's pick up where we left off last time and write a score-based Branch delegate. It will be used as the basis for both of our "real" branching functions. private BranchingDecision BranchCore( BranchAndBoundNode node, double bound, double [][] S) { RowColumnSums(S, Read More...
0 Comments

Quadratic assignment problems: branching

Posted Sunday, July 12, 2009 4:24 PM by Nathan Brixius
(This is part of a long-running series on quadratic assignment problems in C#. Click here to catch up. ) Branching means to divide the search space represented by a node into subnodes. QAP is about making assignments of facilities to locations, so two Read More...
0 Comments

Solver Foundation LINQ to SQL example

Posted Tuesday, June 02, 2009 7:45 AM by Nathan Brixius
Erwin, a modeling consultant and top Solver Foundation user, encountered some problems trying to do two-way data binding using DataTable objects. There are more details on this discussion thread . Ross, a member of the Solver Foundation team, was kind Read More...
1 Comments

Solver Foundation TSP Part II: Directives, Solver Plugins, Model Libraries

Posted Thursday, May 07, 2009 8:47 PM by Nathan Brixius
Here is my as-promised "part 2" to my traveling salesman sample . My goal is not to try and do any "production level" modeling, but instead "point the way" by highlighting different aspects of Solver Foundation's architecture. This time I want to talk Read More...
1 Comments

Creating parameterized Solver Foundation models using LINQ to SQL

Posted Tuesday, May 05, 2009 1:29 PM by Nathan Brixius
On the Solver Foundation MSDN forum there was a question about how to read model data from a DB and use it within a Solver Foundation model. In this post I will extend my production planning sample to use LINQ to SQL. To follow along at home you will Read More...
9 Comments

Solving traveling salesman problems using Solver Foundation

Posted Monday, April 27, 2009 8:18 AM by Nathan Brixius
Here's an example that I walked through during yesterday's INFORMS session. Erwin has two blog postings about Solver Foundation and the traveling salesman problem, but I want to throw in my two cents because I want to emphasize a couple of points: By Read More...
2 Comments

Modeling a production planning problem using Solver Foundation

Posted Friday, April 24, 2009 1:01 PM by Nathan Brixius
In this post I am going to present two complete C# programs for modeling and solving a simple production problem using Solver Foundation. In this example we have two refineries (located in Saudi Arabia and Venzuela) that produce three products: gasoline, Read More...
4 Comments

Simple matrix, vector, permutation utilities

Posted Tuesday, March 24, 2009 9:24 PM by Nathan Brixius
I am going to be rolling out the rest of my branch-and-bound algorithm in the next few posts. To make that easier, in this post I introduce some common matrix, vector, and permutation methods. It turns out that for technical computing applications, C#'s Read More...
1 Comments

Branch-and-bound algorithms for QAP

Posted Monday, March 23, 2009 1:22 PM by Nathan Brixius
This is part 4 in a series of posts laying out a simple branch-and-bound solver for QAP in C#. Last time (several months ago!) I provided a simple bounding procedure for QAP. I want to take a step back and give the high-level algorithm, then in subsequent Read More...
3 Comments

Two way data binding using LINQ and Solver Foundation Services

Posted Friday, December 19, 2008 1:22 PM by Nathan Brixius
Recently on the Microsoft Solver Foundation discussion boards there was a question about two-way data binding and Solver Foundation Services. The MSF-SFS Programming Primer has plenty of examples for helping you learn to use Solver Foundation Services Read More...
0 Comments
Filed under: , ,

Microsoft Solver Foundation: blogs and resources

Posted Saturday, November 15, 2008 3:17 PM by Nathan Brixius
This post is just a roundup of some links for those of you looking for more information about Microsoft Solver Foundation . I see that there have been a bunch of downloads already - please join in the discussion (or click the Discussion tab from the Solver Read More...
3 Comments
Filed under: , ,
More Posts Next page »
 
Page view tracker