Package jline.api.mapqn

Class Mapqn_bnd_lr_pf

java.lang.Object

jline.api.mapqn.Mapqn_bnd_lr_pf

public final class Mapqn_bnd_lr_pf
extends Object

Implementation of bnd_linearreduction_pf.mod linear program This is the Product Form version without phases

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	Mapqn_bnd_lr_pf.PFParameters	Parameters for the Product Form linear reduction model

Method Summary

Modifier and Type	Method	Description
static Mapqn_solution	solve(Mapqn_bnd_lr_pf.PFParameters params)
static Mapqn_solution	solve(Mapqn_bnd_lr_pf.PFParameters params, int objectiveQueue)
static Mapqn_solution	solve(Mapqn_bnd_lr_pf.PFParameters params, int objectiveQueue, String sense)	Solve the product-form linear-reduction LP, optimizing the utilization of the given queue.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

solve

public static Mapqn_solution solve(Mapqn_bnd_lr_pf.PFParameters params)

solve

public static Mapqn_solution solve(Mapqn_bnd_lr_pf.PFParameters params,
 int objectiveQueue)

solve

public static Mapqn_solution solve(Mapqn_bnd_lr_pf.PFParameters params,
 int objectiveQueue,
 String sense)

Solve the product-form linear-reduction LP, optimizing the utilization of the given queue. sense="min" yields the classical LR lower bound, sense="max" the matching upper bound; both are valid bounds because the LP relaxation contains the exact solution.

Parameters:

params - product-form model parameters

objectiveQueue - 1-based queue index to optimize

sense - "min" or "max"

Returns:

LP solution with objective value and variable values