Constraints functions

Functions

blm.AddConstraintMethod
AddConstraint(; qp::QPConstrained, constraint::Function, kwargs...)

Add constraint to a QPConstrained object.

Arguments: qp (QPConstrained): instance of QPConstrained constraint (Function): which constraint to use kwargs (kwargs): keyword arguments for the particular constraint (skip nk and nl)

source
blm.ConstraintAKMMonoMethod
ConstraintAKMMono(; nk::Int64, nl::Int64, gap::Union{Float64, Int64}=0)::QPConstrained

AKM mono constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types gap (int): FIXME

source
blm.ConstraintBiggerThanMethod
ConstraintBiggerThan(; nk::Int64, nl::Int64, gap::Union{Float64, Int64}=0, n_periods::Int64=2)::QPConstrained

Bigger than constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types gap (int): lower bound n_periods (int): number of periods in event study

source
blm.ConstraintFixBMethod
ConstraintFixB(; nk::Int64, nl::Int64, nt::Int64=4)::QPConstrained

Fix B constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types nt (int): FIXME

source
blm.ConstraintLinearMethod
ConstraintLinear(; nk::Int64, nl::Int64, nt::Int64=2)::QPConstrained

Linear constraint. for a set of coeficient nk x nl x nt this makes sure that

a_k1_l1_t - a_k2_l1_t = a_k1_l1_t - a_k2_l1_t
for all l1, t and 2 firms k1, k2

Arguments: nk (int): number of firm types nl (int): number of worker types n_periods (int): number of periods in event study

source
blm.ConstraintMonoKMethod
ConstraintMonoK(; nk::Int64, nl::Int64, gap::Union{Float64, Int64}=0)::QPConstrained

Mono K constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types gap (int): FIXME

source
blm.ConstraintNoneMethod
ConstraintNone(; nk::Int64, nl::Int64)::QPConstrained

No constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types

source
blm.ConstraintParaMethod
ConstraintPara(; nk::Int64, nl::Int64, nt::Int64=2)::QPConstrained

Parallel constraint, worker get same wage everywhere. For a set of coeficient nk x nl x nt this makes sure that

a_k1_l_t = a_k2_l_t
for all l, t and 2 firms k1, k2

Arguments: nk (int): number of firm types nl (int): number of worker types n_periods (int): number of periods in event study

source
blm.ConstraintSmallerThanMethod
ConstraintSmallerThan(; nk::Int64, nl::Int64, gap::Union{Float64, Int64}=0, n_periods::Int64=2)::QPConstrained

Bigger than constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types gap (int): upper bound n_periods (int): number of periods in event study

source
blm.ConstraintStationaryMethod
ConstraintStationary(; nk::Int64, nl::Int64)::QPConstrained

Stationary constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types

source
blm.ConstraintSumMethod
ConstraintSum(; nk::Int64, nl::Int64)::QPConstrained

Sum constraint.

Arguments: nk (int): number of firm types nl (int): number of worker types

source
blm.QPConstrainedSolveMethod
QPConstrainedSolve(P::SparseMatrixCSC{Float64, Int64}, q::Vector{Float64}, qp::QPConstrained)

Solve constrained QP problem, min_x 0.5x'Px + q'x s.t. l <= Ax <= u. Arguments: P (Matrix): P matrix for QP problem q (Vector): q vector for QP problem constraint (Function): which constraint to use kwargs (kwargs): keyword arguments for the particular constraint

source

Contents

Index