Plot the polytope (bounded convex set) of a linear mathematical program
plotPolytope3D(A, b, obj = NULL, type = rep("c", ncol(A)),
nonneg = rep(TRUE, ncol(A)), crit = "max", faces = rep("c",
ncol(A)), plotFaces = TRUE, plotFeasible = TRUE,
plotOptimum = FALSE, latex = FALSE, labels = NULL, ...)The constraint matrix.
Right hand side.
A vector with objective coefficients.
A character vector of same length as number of variables. If entry k is 'i' variable \(k\) must be integer and if 'c' continuous.
A boolean vector of same length as number of variables. If entry k is TRUE then variable k must be non-negative.
Either max or min (only used if add the iso profit line)
A character vector of same length as number of variables. If entry k is 'i' variable \(k\) must be integer and if 'c' continuous. Useful if e.g. want to show the linear relaxation of an IP.
If True then plot the faces.
If True then plot the feasible points/segments
(relevant for IPLP/MILP).
Show the optimum corner solution point (if alternative solutions only one is shown) and add the iso profit line.
If True make latex math labels for TikZ.
If NULL don't add any labels. If 'n' no labels but show the points. If
'coord' add coordinates to the points. Otherwise number all points from one.
Arguments passed to axes3d, plot3d, title3d. Parsed using lists argsAxes3d, argsPlot3d and argsTitle3d.
A rgl window with 3D plot.