Duality

Error

There was an error loading the page.

Contributors

Julien Ugon

Feedback

From users who are members of SIT316 :

Julien Ugon

said

Needs to be tested

10 months ago

History

○

Julien Ugon 10 months ago

Published this.

○

Julien Ugon 10 months ago

Gave some feedback: Needs to be tested

○

Julien Ugon 10 months, 2 weeks ago

Created this as a copy of Canonical form.

Name	Status	Author	Last Modified
Canonical form	Needs to be tested	Julien Ugon	06/08/2024 00:32
Duality	Needs to be tested	Julien Ugon	06/09/2024 00:38

There are 9 other versions that do you not have access to.

Question statement

Find the dual problem for the following linear program:

$\begin{gathered} \var{{optimise}}\text{ } \var{objective} \text{ subject to }\\ \var{system} \end{gathered}$

$x_i≥0, \forall j\in \var{Jp}$

$x_j≤0, \forall j\in \var{Jn}$

Give any introductory information the student needs.

			Name	Type	Generated Value

nvar	integer	4
ncons	integer	7
positivity	list	[ "≤0", "free", "free", "≥0" ]
A	list	Nested 7×4 list
b	list	[ 2, 0, -3, -4, 0, 3, -4 ]
direction	list	List of 7 items
C	list	[ 0, 0, 4, -4 ]
optimise	string	minimise

			Name	Type	Generated Value

x	list	[ "x1", "x2", "x3", "x4" ]
L	list	List of 7 items
Cp	list	List of 7 items
Constraints	list	List of 7 items
system	string	\begin{aligned}-4x_{1} & -1x_{
objective_string	string	0x1+0x2+4x3+-4x4
objective	expression	4x3 - 4x4
Jp	set	set(4)
Jn	set	set(1)
systema	string	\begin{aligned}-4x_{1} & -1x_{
systemb	string	\begin{gathered}-4 x_{1} - x_{

			Name	Type	Generated Value

y	list	List of 7 items
Ad	list	Nested 4×7 list
Mv	list	Nested 7×4 list
objectived_string	string	2y1+0y2+-3y3+-4y4+0y5+3y
objectived	expression	2y1 - 3y3 - 4y4 + 3y6 - 4y7
Ld	list	List of 4 items
Cpd	list	List of 4 items
Constraintsd	list	List of 4 items
Systemd	string	\begin{gathered}-4 y_{1} - 5 y
Jdn	list	[ 4, 6 ]
Jdp	list	[ 1, 5, 7 ]
directionv	list	[ "≥", "=", "=", "≤" ]
optimised	string	maximise
Adlt	matrix	matrix([-4,4,3,-5,0,0,2,-4])
Adgt	matrix	matrix([-4,-5,-1,-5,5,-1,3,0])
Adeq	matrix	Matrix of size 2×8

			Name	Type	Generated Value

reorder	list	[ 1, 4, 6, 0, 3, 2, 5 ]
I1	matrix	Matrix of size 7×7
I2	matrix	Matrix of size 8×8
A1	matrix	matrix([-5,-4,0,0,4,2,3,-4])
A2	matrix	matrix([-5,-4,-1,5,-5,3,-1,0])
A3	matrix	Matrix of size 2×8
c1	vector	vector(-4,2,3,0,0,-4,-3)
J1	set	set(2,4,6)
J2	set	set(1,3)
test	integer	2

			Name	Type	Generated Value

cstudent	list	[ 2, 0, -3, -4, 0, 3, -4 ]
max_conversion	list	Nested 7×2 list
min_conversion	list	Nested 7×2 list
conversion	dict	Dictionary with 7 entries
nonnegativityCodes	list	[ "≤0", "free", "≥0" ]

Automatically regenerate variables?

Name

Data type

Value

xxxxxxxxxx
 
random(3..5)

JME function reference

Description

Number of variables in the system.

Describe what this variable represents, and list any assumptions made about its value.

Can an exam override the value of this variable?

Generated value: `integer`

→ Used by:

A
C
positivity
x

This variable doesn't seem to be used anywhere.

Parts

Dual Problem Gap-fill
1. Gap optimise Choose one from a list
  Add
2. Gap c Matrix entry
  Add
3. Gap lessthan Matrix entry
  Add
4. Gap equalities Matrix entry
  Add
5. Gap greatherthan Matrix entry
  Add
6. Gap Nonnegative Variables Matrix entry
  Add
7. Gap Nonpositive Variables Matrix entry
  Add

Gap-fill

Ask the student a question, and give any hints about how they should answer this part.

optimise c

subject to

Set the number of rows/columns to 0 manually if a constraint type does not exist in the dual.

Less than (≤) constraints

lessthan

Equality constraints

equalities

Greater than (≥) constraints

greatherthan

$y_j≥0, ∀j∈$ {Nonnegative Variables}.

$y_j≤0, ∀j∈$ {Nonpositive Variables}.

Advice

In order to convert a problem to canonical form, we need to perform the following changes

The objective should be maximised.
All variables should be positive.
All constraints should be in the form ≤

$\begin{gathered} \var{{optimise}}\text{ } \var{objective} \text{ subject to }\\ \var{system} \end{gathered}$

$x_i≥0, \forall\in \var{Jp}$

$x_j≤0, \forall j\in \var{Jn}$

The dual problem is:

$\begin{gathered} \var{optimised}\text{ } \var{objectived} \text{ subject to }\\ \var{systemd} \end{gathered}$

$y_i≥0, \forall\in \var{Jdp}$

$y_j≤0, \forall j\in \var{Jdn}$

Give a worked solution to the whole question.

Use this tab to check that this question works as expected.

There was an error which means the tests can't run:

Part	Test	Passed?
Gap-fill
Gap-fill		Hasn't run yet
Choose one from a list
Choose one from a list		Hasn't run yet
Matrix entry
Matrix entry		Hasn't run yet
Matrix entry
Matrix entry		Hasn't run yet
Matrix entry
Matrix entry		Hasn't run yet
Matrix entry
Matrix entry		Hasn't run yet
Matrix entry
Matrix entry		Hasn't run yet
Matrix entry
Matrix entry		Hasn't run yet

This question is used in the following exam:

Duality Exam by Julien Ugon in SIT316.

Loading...

Error

Metadata

Taxonomy: mathcentre

Taxonomy: Kind of activity

Taxonomy: Context

Contributors

Feedback

History

Comment

Checkpoint description

Julien Ugon 10 months ago

Julien Ugon 10 months ago

Julien Ugon 10 months, 2 weeks ago

Error in variable testing condition

Error

Warning

Generated value: `integer`

Parts

Gap-fill

Less than (≤) constraints

Equality constraints

Greater than (≥) constraints

Loading...

Error

Duality

Metadata

Taxonomy: mathcentre

Taxonomy: Kind of activity

Taxonomy: Context

Contributors

Feedback

History

Comment

Checkpoint description

Julien Ugon 10 months ago

Julien Ugon 10 months ago

Julien Ugon 10 months, 2 weeks ago

Error in variable testing condition

Error

Warning

Generated value: integer

Parts

Gap-fill

Less than (≤) constraints

Equality constraints

Greater than (≥) constraints

Generated value: `integer`