Total Tayangan Halaman

Selasa, 22 Mei 2012

Teknik Riset Operasi (TRO)


Dipersembahkan oleh :

Abdun Wijaya (0902309)
Dina Mutiara (0902196)
Pramudiani Ayu P (0909179)
Jurusan : Ilmu Komputer C-1 Universitas Pendidikan Indonesia

Source code mengenai North West Corner yang kelompok kami bahas adalah sebagai berikut :

#include
#include
#include
#include"windows.h"

int main()
{
int demand[20];
int supply[20];
float cost[20][20];         //Cost values
int i,j,k;          //Index values
int nsupply,ndemand;       //Column-Row
int t;      //Temp variable
float o[20],sum;      //Ans
int sumSupply, sumDemand;
start: 


system("cls");
printf("| Menghitung Nilai Cost Terkecil |\n");
printf("| Menggunakan North West Corner |\n");
printf("\n\n");

printf("Penawaran: "); //row
scanf("%d",&nsupply);
printf("\n");
for(j=0;j
{
printf("Produksi Pabrik[%d]: ",(j+1));
scanf("%d",&nsupply[j]);
}
printf("\n");

printf("Permintaan: ");
scanf("%d",&ndemand);
printf("\n");
for(j=0;j
{
printf("Permintaan [%d]: ",(j+1));
scanf("%d",&demand[j]);
}
printf("\n\n");
printf("Biaya Pengiriman(rupiah/buah)\n");

for(i=0;i
{
for(j=0;j
{
printf("masukan Cost[%d][%d]: ",(i+1),(j+1));
scanf("%f",&cost[i][j]);
}
}

//Menampilkan
printf("\n Matrix Berdasarkan Penawaran dan Permintaan");
printf("\n__________________________________________________________________\n");
for(i=0;i
{
for(j=0;j
{
printf("%.0f\t",cost[i][j]);
}
printf("sup: %d",supply[i]);
printf("\n");
}
printf("Permintaan:\n");
for(i=0;i
{
printf("%d\t",demand[i]);
}

//North West Corner
i=j=k=0;
while (i<=nsupply&&j<=ndemand)
{
if (supply[i]
{
t=supply[i];
o[k++]=t*cost[i][j];
supply[i]=0;
demand[j]-=t;
i++;        //Vertical direction
}
else if (supply[i]>demand[j])
{
t=demand[j];
o[k++]=t*cost[i][j];
supply[i]-=t;
demand[j]=0;
j++;       //Horizontal direction
}
else
{
t=demand[j];
o[k++]=t*cost[i][j];
supply[i]=demand[j]=0;
i++;
j++;       //Diagonal direction
}
}

printf("\n__________________________________________________________________");
printf("\n Jumlah : ");
sum=0;
for (i=0;i<(k-1);i++)

sum+=o[i];
printf("%.2f | ",o[i]);
}
printf(" = Rp. %.f,00",sum);
printf("\n");

getchar();

}

Tidak ada komentar:

Posting Komentar