深圳技术大学算法设计oj A : 最佳生产规划

Description

一工厂使用 � 种原料生产 � 种产品，每种产品需要消耗各类原料，同时有个固定售价，求各类产品最优生产数量，使全部售卖得到的收入最高.

Input

• 第一行为1≤�≤10 和 1≤�≤100；
• 第二行为 � 个数，{��|�∈1,2,…,�} 表示第 � 种产品的售价，0≤��≤1000；
• 接下来 � 行，每行 �+1 个数，第 � 行前 � 个数 {���|�∈1,2,…,�} 表示生产第 � 种产品对第 � 种原料的消耗量，第 �+1 个数 �� 为第 � 种原料的储量，0≤���,��≤1000.

Output

合理分配产品生产能取得的最大收入，输出结果与答案误差需要在 10−6 以内.

Sample

#0

Input

Copy

2 3
12 15
0.25 0.5 120
0.5 0.5 150
0.25 0 50

Output

Copy

4140

#1

Input

Copy

5 4
424.35 729.17 797.18 260.21 738.91 
982.79 466.90 639.41 492.25 786.74 887.45 
681.42 473.15 431.59 714.24 506.01 117.62 
785.97 860.24 716.31 762.74 333.15 759.97 
127.21 944.20 470.72 23.52 788.41 180.83 

Output

Copy

217.253207

线性规划

#include<iostream>   
#include<cmath>  
#include"stdio.h"
using namespace std;
#define M 10000   
double kernel[110][310];  
int m = 0, n = 0, t = 0;
void input()
{
	cin>>n;
	cin>>m;
	// m = 3;
 
 
	int i, j;
	//初始化核心向量   
	for (i = 0; i <= m + 1; i++)
		for (j = 0; j <= n + m + m; j++)
			kernel[i][j] = 0;
	for (i=1;i<=n;i++)   
		cin>>kernel [0][i];   
	for (i=1;i<=m;i++)    
	{    
		// cout<<"    不等式"<<i<<"  ";   
		for (j=1;j<=n+2;j++)
        {
            if(j==n+1){
                kernel[i][j]=1;
            }
            else{
                cin>>kernel [i][j];  
            }
             
        }      
			
	}   
	
 
	for (i = 1; i <= m; i++)
	{
		kernel[i][0] = kernel[i][n + 2];
		kernel[i][n + 2] = 0;
	}
	
	t = -1;
	if (t == -1)
		for (i = 1; i <= n; i++)
			kernel[0][i] = (-1)*kernel[0][i];
	for (i = 1; i <= m; i++)
	{
		kernel[i][n + i] = kernel[i][n + 1];
		if (i != 1)
			kernel[i][n + 1] = 0;
	}
}
 
//算法函数   
void comput()
{
	int i, j, flag, temp1, temp2, h, k = 0, temp3[100];
	double a, b[110], temp, temp4[110], temp5[110], f = 0, aa, d, c;
	for (i = 1; i <= m; i++)
		temp3[i] = 0.0000;
	for (i = 0; i < 11; i++)
	{
		temp4[i] = 0.000;
		temp5[i] = 0.0000;
	}
	for (i = 1; i <= m; i++)
	{
		if (kernel[i][n + i] == -1)
		{
			kernel[i][n + m + i] = 1;
			kernel[0][n + m + i] = M;
			temp3[i] = n + m + i;
		}
		else
			temp3[i] = n + i;
	}
	for (i = 1; i <= m; i++)
		temp4[i] = kernel[0][temp3[i]];
   
	do {
		for (i = 1; i <= n + m + m; i++)
		{
			a = 0;
			for (j = 1; j <= m; j++)
				a += kernel[j][i] * temp4[j];
			kernel[m + 1][i] = kernel[0][i] - a;
		}
		for (i = 1; i <= n + m + m; i++)
		{
			if (kernel[m + 1][i] >= 0) flag = 1;
			else
			{
				flag = -1;
				break;
			}
		}
		if (flag == 1)
		{
			for (i = 1; i <= m; i++)
			{
				if (temp3[i] <= n + m) temp1 = 1;
				else
				{
					temp1 = -1;
					break;
				}
			}
			if (temp1 == 1)
			{
				// cout << " 此线性规划的最优解存在!" << endl << endl << "  最优解为：" << endl << endl << "     ";
				for (i = 1; i <= m; i++)
					temp5[temp3[i]] = kernel[i][0];
				for (i = 1; i <= n; i++)
					f += t * kernel[0][i] * temp5[i];
 
				for (i = 1; i <= n; i++)
				{
					// cout << "x" << i << " = " << temp5[i];
					// if (i != n)
						// cout << "， ";
				}
				// cout << " ;" << endl << endl << "     最优目标函数值f= " << f << endl << endl;
                printf("%.6f\n",f);
				return;
			}
			else
			{
				// cout << " 此线性规划无解" << endl << endl;
				return;
			}
		}
		if (flag == -1)
		{
			temp = 100000;
			for (i = 1; i <= n + m + m; i++)
				if (kernel[m + 1][i] < temp)
				{
					temp = kernel[m + 1][i];
					h = i;
				}
 
			for (i = 1; i <= m; i++)
			{
				if (kernel[i][h] <= 0) temp2 = 1;
				else {
					temp2 = -1;
					break;
				}
			}
		}
		if (temp2 == 1)
		{
			// cout << "此线性规划无约束";
			return;
		}
		if (temp2 == -1)
		{
			c = 100000;
			for (i = 1; i <= m; i++)
			{
				if (kernel[i][h] != 0)  b[i] = kernel[i][0] / kernel[i][h];
				if (kernel[i][h] == 0)  b[i] = 100000;
				if (b[i] < 0)     b[i] = 100000;
				if (b[i] < c)
				{
					c = b[i];
					k = i;
				}
			}
			temp3[k] = h;
			temp4[k] = kernel[0][h];
			d = kernel[k][h];
			for (i = 0; i <= n + m + m; i++)
				kernel[k][i] = kernel[k][i] / d;
			for (i = 1; i <= m; i++)
			{
				if (i == k)
					continue;
				aa = kernel[i][h];
				for (j = 0; j <= n + m + m; j++)
					kernel[i][j] = kernel[i][j] - aa * kernel[k][j];
			}
		}
 
	} while (1);
	return;
}
  
int main()
{
	input();
    for(int i=1;i<n;i++){
        for(int j=1;j<m+2;j++){
            // cout<<kernel[i][j]<<" ";
        }
        // cout<<endl;
    }
	comput();
	// int a = 0;
	// scanf("%d", &a);
    // cout<<f<<endl;
	return 0;
}