GNU Octave - solve linear minimization/maximization problem using glpk

glpk.m

################################################################################
# solve linear minimization/maximization problem using glpk
#
# based on example from:
# https://octave.sourceforge.io/octave/function/glpk.html
################################################################################

# objective function coefficients
c = [12000,9000]';

# constraint coefficients
A = [-200, 100;
     2.1, 0.9;];

# right side values of constraints
b = [0,21]';

# lower and upper bounds for the variables
lb = [0, 0];
ub = [];

# constraint type
#   F - A free (unbounded) constraint (the constraint is ignored).
#   U - An upper bound inequality constraint
#   S - An equality constraint
#   L - A lower bound inequality constraint
ctype = "UU";

# variable type
#   I - integer
#   C - continuous
vartype = "CC";

# sense
#    1: minimization
#   -1: maximization
s = -1;

# define the behavior of solver
param.msglev = 1;
param.itlim = 100;

################################################################################

[x, f, status, extra] = glpk (c, A, b, lb, ub, ctype, vartype, s, param);