Bincont2lin - Revision history

Elias at 12:14, 10 January 2012

2012-01-10T12:14:44Z

← Older revision		Revision as of 07:14, 10 January 2012
Line 8:		Line 8:
	==Calling Syntax==		==Calling Syntax==

	<~~syntaxhighlight~~ lang="matlab">		<source lang="matlab">
	Prob = bincont2lin(Prob, idx_prod, idx_bin, idx_cont)		Prob = bincont2lin(Prob, idx_prod, idx_bin, idx_cont)
	</~~syntaxhighlight~~>		</source>

	==Inputs==		==Inputs==

Elias at 14:54, 22 July 2011

2011-07-22T14:54:09Z

← Older revision		Revision as of 09:54, 22 July 2011
Line 1:		Line 1:
			[[Category:Utility Functions]]
	==Purpose==		==Purpose==

Elias: /* Calling Syntax */

2011-07-22T10:15:39Z

Calling Syntax

← Older revision		Revision as of 05:15, 22 July 2011
Line 8:		Line 8:

	<syntaxhighlight lang="matlab">		<syntaxhighlight lang="matlab">
	Prob = bincont2lin(Prob, idx_prod, ~~idx bin~~, ~~idx cont~~)		Prob = bincont2lin(Prob, idx_prod, idx_bin, idx_cont)
	</syntaxhighlight>		</syntaxhighlight>

Elias: Created page with "==Purpose== Adds constraints when modeling with binary variables which are multiplied by integer or continuous variables. This is the most efficient way to get rid off quadra..."

2011-07-22T10:15:26Z

Created page with "==Purpose== Adds constraints when modeling with binary variables which are multiplied by integer or continuous variables. This is the most efficient way to get rid off quadra..."

New page

==Purpose==

Adds constraints when modeling with binary variables which are multiplied by integer or continuous variables.

This is the most efficient way to get rid off quadratic objectives or constraints.

==Calling Syntax==

<syntaxhighlight lang="matlab">
Prob = bincont2lin(Prob, idx_prod, idx bin, idx cont)
</syntaxhighlight>

==Inputs==

{| class="wikitable"
!''Prob''||Problem structure to be converted.
|-
|''idx_prod''||Indices for product variables.
|-
|''idx_bin''||Indices for binary variables.
|-
|''idx_cont''||Indices for continuous/integer variables.
|}

==Outputs==

{| class="wikitable"
!Output||Description
|-
|''Prob''||Problem structure with added constraints.
|}

==Description==

''prod ''= ''bin * cont''. The problem should be built with the extra variables prod in place of the ''bin * cont ''products.

The indices of the unique product variables are needed to convert the problem properly.

Three inequalities are added to the problem:

''prod <''= ''cont''

''prod >''= ''cont - xU * ''(1 ''- bin'')

''prod <''= ''xU * bin''

By adding this prod will always equal ''bin * cont''.