cornerPointsCont

Calculate the corner points for the polytope Ax&lt;=b assuming all variables are
continuous.

Make 2D and 3D plots of linear programming (LP),
integer linear programming (ILP), or mixed integer linear programming (MILP) models
with up to three objectives. Plots of both the solution and criterion space are possible.
For instance the non-dominated (Pareto) set for bi-objective LP/ILP/MILP programming models
(see vignettes for an overview). The package also contains an function for checking if a point
is inside the convex hull.

Lars Relund

gMOIP

Tools for 2D and 3D Plots of Single and Multi-Objective
Linear/Integer Programming Models

Lars Relund Nielsen

cornerPointsCont function

<dl><dt>A</dt>
<dd>Constraint matrix.</dd>
<dt>b</dt>
<dd>Right hand side.</dd>
<dt>nonneg</dt>
<dd>A boolean vector of same length as number of variables. If
entry k is TRUE then variable k must be non-negative.</dd></dl>

Arguments

Lars Relund <a href="/link/lars%40relund.dk?package=gMOIP&version=1.5.3" data-mini-rdoc="gMOIP::lars@relund.dk">lars@relund.dk</a>

Author

Calculate the corner points for the polytope Ax&lt;=b assuming all variables are
continuous. — cornerPointsCont

<dl>

<dt>A</dt>
<dd>Constraint matrix.</dd>


<dt>b</dt>
<dd>Right hand side.</dd>


<dt>nonneg</dt>
<dd>A boolean vector of same length as number of variables. If
entry k is TRUE then variable k must be non-negative.</dd>

</dl>

Lars Relund <a href='mailto:lars@relund.dk'>lars@relund.dk</a>

cornerPointsCont: Calculate the corner points for the polytope Ax<=b assuming all variables are continuous.

Description

Usage

Value

Arguments

Author