EllAlgo 1.6.13
Loading...
Searching...
No Matches
Public Member Functions | List of all members
ProfitOracleQ Class Reference

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()
 

Detailed Description

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
See also
ProfitOracle

Constructor & Destructor Documentation

◆ ProfitOracleQ()

ProfitOracleQ::ProfitOracleQ ( double  p,
double  A,
double  k,
const Vec &  a,
const Vec &  v 
)
inline

Construct a new profit q oracle object.

Parameters
[in]pthe market price per unit
[in]Athe scale of production
[in]ka given constant that restricts the quantity of x1
[in]athe output elasticities
[in]voutput price

Member Function Documentation

◆ assess_optim_q()

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()

Parameters
[in]yinput quantity (in log scale)
[in,out]gammathe best-so-far optimal value
[in]retrywhether it is a retry
Returns
Cut and the updated best-so-far value
See also
cutting_plane_optim_q

The documentation for this class was generated from the following file: