|
EllAlgo 1.6.13
|
Oracle for profit maximization problem (discrete version) More...
#include <profit_oracle.hpp>
Public Member Functions | |
| ProfitOracleQ (double p, double A, double k, const Vec &a, const Vec &v) | |
| Construct a new profit q oracle object. | |
| auto | assess_optim_q (const Vec &y, double &gamma, bool retry) -> std::tuple< Cut, bool, Vec, bool > |
| Make object callable for cutting_plane_optim_q() | |
Oracle for profit maximization problem (discrete version)
This example is taken from [Aliabadi and Salahi, 2013]
max p(A x1^alpha x2^beta) - v1*x1 - v2*x2 s.t. x1 \le k
where:
p(A x1^alpha x2^beta): Cobb-Douglas production function p: the market price per unit A: the scale of production alpha, beta: the output elasticities x: input quantity (must be integer value) v: output price k: a given constant that restricts the quantity of x1
Construct a new profit q oracle object.
| [in] | p | the market price per unit |
| [in] | A | the scale of production |
| [in] | k | a given constant that restricts the quantity of x1 |
| [in] | a | the output elasticities |
| [in] | v | output price |
| auto ProfitOracleQ::assess_optim_q | ( | const Vec & | y, |
| double & | gamma, | ||
| bool | retry | ||
| ) | -> std::tuple< Cut, bool, Vec, bool > |
Make object callable for cutting_plane_optim_q()
| [in] | y | input quantity (in log scale) |
| [in,out] | gamma | the best-so-far optimal value |
| [in] | retry | whether it is a retry |