<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://tomwiki.com/index.php?action=history&amp;feed=atom&amp;title=CPLEX_abc2gap</id>
	<title>CPLEX abc2gap - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://tomwiki.com/index.php?action=history&amp;feed=atom&amp;title=CPLEX_abc2gap"/>
	<link rel="alternate" type="text/html" href="http://tomwiki.com/index.php?title=CPLEX_abc2gap&amp;action=history"/>
	<updated>2026-10-31T22:03:52Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.1</generator>
	<entry>
		<id>http://tomwiki.com/index.php?title=CPLEX_abc2gap&amp;diff=961&amp;oldid=prev</id>
		<title>Elias: Created page with &quot;{{Part Of Manual|title=the CPLEX Manual|link=CPLEX}} ==Purpose==  Converting a general assignment problem (GAP) to a standard form suitable for a MIP solver.  The GAP p...&quot;</title>
		<link rel="alternate" type="text/html" href="http://tomwiki.com/index.php?title=CPLEX_abc2gap&amp;diff=961&amp;oldid=prev"/>
		<updated>2011-08-15T15:17:05Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;{{Part Of Manual|title=the CPLEX Manual|link=&lt;a href=&quot;/index.php?title=CPLEX&quot; title=&quot;CPLEX&quot;&gt;CPLEX&lt;/a&gt;}} ==Purpose==  Converting a general assignment problem (GAP) to a standard form suitable for a MIP solver.  The GAP p...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Part Of Manual|title=the CPLEX Manual|link=[[CPLEX|CPLEX]]}}&lt;br /&gt;
==Purpose==&lt;br /&gt;
&lt;br /&gt;
Converting a general assignment problem (GAP) to a standard form suitable for a MIP solver.&lt;br /&gt;
&lt;br /&gt;
The GAP problem is formulated as&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\begin{array}{cl}\min\limits_{x_{ij}} &amp;amp; f(x) = \sum_{i=1}^m\sum_{j=1}^n c_{ij} * x_{ij}\\ &amp;amp;  \\s/t &amp;amp;\sum_{j=1}^n x_{ij} = 1 ~~ , i =1,...,m\\&amp;amp;\sum_{i=1}^m a_{ij} * x_{ij} \leq b_j~~,j=1,..,n\\&amp;amp;x \in B^{m \times n}, B=\{0,1\}.\\\end{array}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Calling  Syntax==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
[c, x L, x U, b L, b U, a, sos1] = abc2gap( A, b, C, SOS1);&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Description  of Input==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Input||Description&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;A&amp;#039;&amp;#039;||A &amp;#039;&amp;#039;m × n &amp;#039;&amp;#039;constraint matrix for GAP constraints.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;b&amp;#039;&amp;#039;||A &amp;#039;&amp;#039;m × &amp;#039;&amp;#039;1 right hand side vector.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;C&amp;#039;&amp;#039;||A &amp;#039;&amp;#039;m × n &amp;#039;&amp;#039;cost matrix for GAP constraints.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;SOS1&amp;#039;&amp;#039;||Logical variable, default false.  If  true, generate output  for sos1 handling with CPLEX. Otherwise generate output giving an equivalent formulation with standard integer variables.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Description  of Output==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Output||Description&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;c&amp;#039;&amp;#039;||Linear objective function cost coefficients, vector &amp;#039;&amp;#039;m * n × &amp;#039;&amp;#039;1.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;x_L&amp;#039;&amp;#039;||Lower bounds on design parameters &amp;#039;&amp;#039;x&amp;#039;&amp;#039;.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;x_U&amp;#039;&amp;#039;||Upper bounds on design parameters &amp;#039;&amp;#039;x&amp;#039;&amp;#039;.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;b_ L&amp;#039;&amp;#039;||Lower bounds on the &amp;#039;&amp;#039;m &amp;#039;&amp;#039;+ &amp;#039;&amp;#039;n &amp;#039;&amp;#039;linear constraints.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;b_U&amp;#039;&amp;#039;||Upper bounds on the linear constraints.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;a&amp;#039;&amp;#039;||Sparse &amp;#039;&amp;#039;m &amp;#039;&amp;#039;+ &amp;#039;&amp;#039;n × m * n &amp;#039;&amp;#039;matrix for linear constraints.&lt;br /&gt;
|-&lt;br /&gt;
|&amp;#039;&amp;#039;sos1&amp;#039;&amp;#039;||If input variable &amp;#039;&amp;#039;SOS&amp;#039;&amp;#039;1 is true, structure with sos1 variable information in the form suitable for the Matlab CPLEX interface routine &amp;#039;&amp;#039;cplex.m&amp;#039;&amp;#039;, otherwise empty.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
Converting a general assignment problem (GAP) to standard form suitable for a mixed-integer programming solver. Either binary or sos1 variables are used.&lt;/div&gt;</summary>
		<author><name>Elias</name></author>
	</entry>
</feed>