ExDualCQKnP Class Reference
Continuous Quadratic Knapsack Problems (CQKnP) solver derived from the DualCQKnP class (and therefore from CQKnPClass) and extending it, using the same standard dual-ascent approach, to non-negative quadratic costs and extended real bounds. More...
#include <ExDualCQKnP.h>
Inheritance diagram for ExDualCQKnP:
Additional Inherited Members | |
 Public Types inherited from CQKnPClass | |
| Public Member Functions inherited from DualCQKnP | |
| DualCQKnP (const bool sort=true, const double eps=1e-6) | |
| The most important operation for solving the CQKnP with a dual method is the sorting of the items for nondecreasing elements. More... | |
| void | SetSort (const bool WhchSrt=false) |
| Allows to change the sorting procedures to be used in the next calls to SolveKNP(); see the comments to the constructor for details. More... | |
| Public Member Functions inherited from CQKnPClass | |
| virtual void | ReadInstance (std::istream &inFile, bool RBV=false) |
| Read the instance from file. More... | |
| virtual int | KNPn (void) |
| Returns the current number of items. More... | |
| virtual void | WriteInstance (std::ostream &oFile, const int precc=16, const int precv=16) |
| Write the instance to the provided ostream in the "complete" format read by ReadInstance() [see above]. More... | |
| Protected Attributes inherited from DualCQKnP | |
| double * | A |
| vector of lower bounds | |
| double * | B |
| vector of upper bounds | |
| double * | C |
| vector of linear costs | |
| double * | D |
| vector of quadratic costs | |
| double | McB |
| volume value | |
| bool | sense |
| sense of knapsack constraint | |
| double | LB |
| lower bound on dual variable | |
| double | UB |
| upper bound on dual variable | |
| int * | I |
| optimal ordering | |
| int | nSort |
| how many elements we have to sort | |
| double * | OV |
| values upon which to order | |
| double * | XSol |
| primal solution | |
| double | muStar |
| optimal dual solution | |
| bool | WSort |
| which sorting procedure is used | |
| double | OptVal |
| The Optimal Value. | |
| double | DefEps |
| precision required to construct the solution | |
| Protected Attributes inherited from CQKnPClass | |
| int | n |
| total number of items | |
| int | status |
| status of the algorithm: it is an int so that derived classes can use it to encode other information apart from the return value of SolveKNP(). More... | |
| Static Protected Attributes inherited from DualCQKnP | |
| static int * | QSStck |
| the stack to simulate recursive calls in QS | |
| static int | InstCntr |
| number of active instances | |
| static int | maxvl |
| max value of items | |
Detailed Description
Continuous Quadratic Knapsack Problems (CQKnP) solver derived from the DualCQKnP class (and therefore from CQKnPClass) and extending it, using the same standard dual-ascent approach, to non-negative quadratic costs and extended real bounds.
