Please help!# Computation - 科学计算
s*m
1 楼
Maximize g
Subject to g<=c1m1/q1, g<=c2m2/q2,…, g<=c_nm_n/q_n
Σ(n, i=1)m_i=N
g, m1, m2,…,m_n>=0, integers,
Where c1,c2,…c_n,q1, q2,…q_n, N are positive integer parameters.
Suppose that the problem size, n, is very large, develop an efficient optimal
algorithm for this problem. What is the computational complexity of your
algorithm?
Subject to g<=c1m1/q1, g<=c2m2/q2,…, g<=c_nm_n/q_n
Σ(n, i=1)m_i=N
g, m1, m2,…,m_n>=0, integers,
Where c1,c2,…c_n,q1, q2,…q_n, N are positive integer parameters.
Suppose that the problem size, n, is very large, develop an efficient optimal
algorithm for this problem. What is the computational complexity of your
algorithm?
