📄 15.htm
字号:
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<title>CTerm非常精华下载</title>
</head>
<body bgcolor="#FFFFFF">
<table border="0" width="100%" cellspacing="0" cellpadding="0" height="577">
<tr><td width="32%" rowspan="3" height="123"><img src="DDl_back.jpg" width="300" height="129" alt="DDl_back.jpg"></td><td width="30%" background="DDl_back2.jpg" height="35"><p align="center"><a href="http://202.112.20.132"><font face="黑体"><big><big>白云黄鹤★</big></big></font></a></td></tr>
<tr>
<td width="68%" background="DDl_back2.jpg" height="44"><big><big><font face="黑体"><p align="center"> 遗传算法 </font></big></big></td></tr>
<tr>
<td width="68%" height="44" bgcolor="#000000"><font face="黑体"><big><big><p align="center"></big></big><a href="http://cterm.163.net"><img src="banner.gif" width="400" height="60" alt="banner.gif"border="0"></a></font></td>
</tr>
<tr><td width="100%" colspan="2" height="100" align="center" valign="top"><br><p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="16.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>
标 题: 遗传算法（15） <br>
发信站: 武汉白云黄鹤站 (Wed May 31 21:51:45 2000), 站内信件 <br>
<br>
//print_format.c <br>
<br>
#include "f:\coy\mywork\lunwen\gaopc\thesis.h" <br>
void print_equalities(equal,t_var,t_equ,coeff,rhs) <br>
MATRIX equal; <br>
VECTOR rhs; <br>
int t_var, <br>
t_equ; <br>
IVECTOR coeff; <br>
{ <br>
int i,j,flag = 0; <br>
fprintf(output,"\n\nEQUALITIES :\n"); <br>
for(i=1; i<=t_equ; i++) <br>
{ <br>
flag = 0; <br>
for(j=1; j<=t_var+1; j++) <br>
{ <br>
if((flag == 0)&&(equal[i][j] != 0.0)) <br>
{ <br>
{ <br>
fprintf(output," %3.2fX%d",equal[i][j],coeff[j]); <br>
flag = 1; <br>
} <br>
else if(j == t_var + 1) <br>
fprintf(output," = %3.2f\n",rhs[i]); <br>
else if(equal[i][j] < 0.0) <br>
fprintf(output," - %3.2fX%d",fabs(equal[i][j]),coeff[j]); <br>
else if(equal[i][j] > 0.0) <br>
fprintf(output," + %3.2fX%d",fabs(equal[i][j]),coeff[j]); <br>
} <br>
} <br>
} <br>
void print_inequalities(equal,t_var,t_equ,coeff,ineq_rhs) <br>
MATRIX equal; <br>
VECTOR ineq_rhs; <br>
int t_var, <br>
t_equ; <br>
IVECTOR coeff; <br>
{ <br>
int i,j,flag = 0; <br>
fprintf(output,"\n\nINEQUALITIES :\n"); <br>
for(i=1; i<=t_equ; i++) <br>
{ <br>
flag = 0; <br>
for(j=1; j<=t_var+1; j++) <br>
{ <br>
if((flag == 0)&&(equal[i][j] != 0.0)) <br>
{ <br>
fprintf(output," %3.2fX%d",equal[i][j],coeff[j]); <br>
flag = 1; <br>
} <br>
else if(j == t_var + 1) <br>
fprintf(output," <= %3.2f\n",ineq_rhs[i]); <br>
else if(equal[i][j] < 0.0) <br>
fprintf(output," - %3.2fX%d",fabs(equal[i][j]),coeff[j]); <br>
else if(equal[i][j] > 0.0) <br>
fprintf(output," + %3.2fX%d",fabs(equal[i][j]),coeff[j]); <br>
} <br>
} <br>
} <br>
void print_domains(equal,t_equ) <br>
MATRIX equal; <br>
int t_equ; <br>
{ <br>
{ <br>
int i,j,temp; <br>
fprintf(output,"\n\nDOMAINS :\n"); <br>
for(i=1; i<=t_equ; i++) <br>
{ <br>
for(j=1; j<=3; j++) <br>
{ <br>
if(j == 2) <br>
fprintf(output," <= X%-2d <= ",(int)equal[i][j]); <br>
else <br>
fprintf(output," %3.2f ",equal[i][j]); <br>
} <br>
fprintf(output,"\n"); <br>
} <br>
} <br>
<br>
-- <br>
＼○／ <br>
┃ <br>
／\ <br>
脖子扭扭，屁股扭扭，大家一起来跳舞 <br>
<br>
<br>
<br>
※ 来源:．武汉白云黄鹤站 bbs.whnet.edu.cn．[FROM: 211.69.196.11] <br>
</small><hr>
<p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="16.htm">下一篇</a>]
<p align="center"><a href="http://cterm.163.net">欢迎访问Cterm主页</a></p>
</table>
</body>
</html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -