正文
线性规划java源代码 线性规划程序编写
小程序：扫一扫查出行【扫一扫了解最新限行尾号】
复制小程序
运筹学线性规划程序（或两阶段法）用java或c，c++都可以
#include stdio.h
#include stdlib.h
#define MAX 100
#define STP 100
int stop=1; //迭代记数变量
int status; //iterative迭代返回值：1唯一最优线性规划java源代码，0无界解线性规划java源代码，-1无穷多最优解 -2迭代超过限制次数
int step=1; //目前阶段
double a[MAX][MAX],b[MAX],c[MAX],temp_c[MAX],max=0; //方程组相关系数
int num_x; //变量个数
int num_st; //约束方程数
int num_ar=0; //人工变量个数
int arti[MAX]; //人工变量下标
int base[MAX]; //基变量下标
int ma_mi; //1为求最大值线性规划java源代码，2为求最小值
void create(); //建立方程组
void iterative(); //单纯型法迭代
void output(); //输出结果
void banner(); //打印程序标题
void exchange(); //交换两阶段价值系数
void show(); //输出方程组
void main() {
int i,j,k;
banner();
create();
//保存原价值系数，转换为第一阶段价值系数
for(i=1;i=num_x;i++) {
k=0;
for(j=1;j=num_ar;j++) if(i==arti[j]) k=1;
if(k==1) temp_c=-1;
else temp_c=0;
}
exchange(c,temp_c);
printf("\n\n第一阶段问题为：\n\n");
show();
step++;
printf("\n\n按回车开始第一阶段迭代");
getchar();
getchar();
iterative();
if(status==-2) {
puts("迭代超过限制次数强行终止！\n");
puts("\n按回车结束");
getchar();
exit(0);
}
output();
if(max!=0) {
puts("\n\n原问题无可行解。\n");
puts("\n按回车结束");
getchar();
exit(0);
}
//转换为第二阶段价值系数
exchange(c,temp_c);
//把人工变量列全设为0
for(i=1;i=num_ar;i++) {
c[arti]=0;
for(j=1;j=num_st;j++) a[j][arti]=0;
}
puts("\n\n第二阶段问题为：\n\n");
show();
puts("\n\n按回车开始第二阶段迭代");
getchar();
iterative();
switch(status) {
case 1:
output();
puts("\n\n原问题有唯一最优解。\n");
puts("\n按回车结束");
getchar();
exit(0);
case 0:
puts("\n\n原问题为无界解。\n");
puts("\n按回车结束");
getchar();
exit(0);
case -1:
output();
puts("\n\n原问题有无穷多最优解。\n");
puts("\n按回车结束");
getchar();
exit(0);
case -2:
puts("迭代超过限制次数强行终止！\n");
puts("\n按回车结束");
getchar();
exit(0);
}//switch
}
void banner() {
printf("\t\t****************************************\n");
printf("\t\t 单纯型法解线性规划问题\n");
printf("\t\t 作者：Thunder\n");
printf("\t\t****************************************\n");
printf("\n");
}
void show() {
//对方程组以自然线性规划java源代码的格式输出，系数为零的x不显示
//为1的不显示系数1，-1系数只显示负号
int i,j,k;
switch(step) {
case 1:
printf("min z= ");
printf("x[%d]",arti[1]);
for(i=2;i=num_ar;i++) printf(" + x[%d]",arti);
break;
case 2:
printf("max z= ");
printf("%lg x[%d]",c[1],1);
for(i=2;i=num_x;i++) {
if(c==1) printf(" + x[%d]",i);
else if(c==-1) printf(" - x[%d]",i);
else if(c=0) printf(" +%lg x[%d]",c,i);
else printf(" %lg x[%d]",c,i);
}
break;
}
printf("\nst:\n");
for(i=1;i=num_st;i++) {
k=0;
for(j=1;j=num_x;j++) {
if(a[j]!=0) {
if(a[j]==1k!=0) printf(" + x[%d]",j);
else if(a[j]==1k==0) printf(" x[%d]",j);
else if(a[j]==-1) printf(" - x[%d]",j);
else if(a[j]=0k!=0) printf(" +%lg x[%d]",a[j],j);
else if(a[j]=0k==0) printf(" %lg x[%d]",a[j],j);
else printf(" %lg x[%d]",a[j],j);
k=1;
}
}
printf(" == %lg\n",b);
}
printf(" x[1]~x[%d]=0",num_x);
}
void exchange() {
int i;
double temp[MAX];
for(i=1;i=num_x;i++) {
temp=temp_c;
temp_c=c;
c=temp;
}
}
void create() {
//输入方程组系数，每个方程输完后回显确认
int i,j,k,re_st[MAX],tnum_x,num_addv=0,num_ba=0;
char confirm;
while(1) {
printf("请选择：1、求最大值，2、求最小值：(1/2)");
scanf("%d",ma_mi);
if(ma_mi!=1ma_mi!=2) printf("输入错误，重新选择。");
else break;
}
while(1) {
printf("指定变量个数：");
scanf("%d",num_x);
printf("输入价值系数c1-c%d:\n",num_x);
for(i=1;i=num_x;i++) {
printf("c%d=",i);
scanf("%lf",c);
}
if(ma_mi==1) printf("max z= ");
else printf("min z= ");
printf("%lg x[%d]",c[1],1);
for(i=2;i=num_x;i++) {
if(c=0) printf(" +%lg x[%d]",c,i);
else printf(" %lg x[%d]",c,i);
}
printf("\n正确吗？：(y/n)");
getchar();
confirm=getchar();
if (confirm=='y') break;
else if(confirm=='n') continue;
}
printf("输入约束方程组个数：");
scanf("%d",num_st);
for(i=1;i=num_st;i++) {
printf("st.%d:\n",i);
while(1) {
printf("请选择：1、==，2、=，3、= ：(1/2/3)");
scanf("%d",re_st);
if(re_st!=1re_st!=2re_st!=3) printf("输入错误，请重新选择。");
else break;
}
printf("输入技术系数：\n");
for(j=1;j=num_x;j++) {
printf("a%d=",j);
scanf("%lf",a[j]);
}
printf("输入资源拥有量：\nb%d=",i);
scanf("%lf",b);
printf("st.%i:\n",i);
printf("%lg x[%d]",a[1],1);
for(j=2;j=num_x;j++) {
if(a[j]=0) printf(" +%lg x[%d]",a[j],j);
else printf(" %lg x[%d]",a[j],j);
}
switch(re_st) {
case 1: printf(" == %lg",b); break;
case 2: printf(" = %lg",b); break;
case 3: printf(" = %lg",b); break;
}
while(1) {
printf("\n正确吗？(y/n)");
getchar();
confirm=getchar();
if (confirm=='y') break;
else if(confirm=='n') {i-=1; break;}
}
}
//显示输入的方程组
printf("\n原问题为：\n\n");
if(ma_mi==1) printf("max z= ");
else printf("min z= ");
printf("%lg x[%d]",c[1],1);
for(i=2;i=num_x;i++) {
if(c==1) printf(" + x[%d]",i);
else if(c==-1) printf(" - x[%d]",i);
else if(c=0) printf(" +%lg x[%d]",c,i);
else printf(" %lg x[%d]",c,i);
}
printf("\nst:\n");
for(i=1;i=num_st;i++) {
k=0;
for(j=1;j=num_x;j++) {
if(a[j]!=0) {
if(a[j]==1k!=0) printf(" + x[%d]",j);
else if(a[j]==1k==0) printf(" x[%d]",j);
else if(a[j]==-1) printf(" - x[%d]",j);
else if(a[j]=0k!=0) printf(" +%lg x[%d]",a[j],j);
else if(a[j]=0k==0) printf(" %lg x[%d]",a[j],j);
else printf(" %lg x[%d]",a[j],j);
k=1;
}
}
switch(re_st) {
case 1:
printf(" == %lg\n",b);
break;
case 2:
printf(" = %lg\n",b);
break;
case 3:
printf(" = %lg\n",b);
break;
}
}
printf(" x[1]~x[%d]=0\n",num_x);
tnum_x=num_x;
for(i=1;i=num_st;i++) {
switch(re_st) {
case 1:
case 3:
num_x+=1;
break;
case 2:
num_x+=2;
break;
}
}
//化为标准形式
if(ma_mi==2) for(i=1;i=tnum_x;i++) c*=-1; //求最小值时，系数变相反数
for(i=1;i=num_st;i++) {
switch(re_st) {
case 1:
num_addv++;
num_ba++;
num_ar++;
c[tnum_x+num_addv]=0;
base[num_ba]=arti[num_ar]=tnum_x+num_addv;
for(j=tnum_x+1;j=num_x;j++)
if(j==tnum_x+num_addv) a[tnum_x+num_addv]=1;
else a[j]=0;
break;
case 2:
num_addv++;
c[tnum_x+num_addv]=0;
num_addv++;
num_ba++;
num_ar++;
c[tnum_x+num_addv]=0;
base[num_ba]=arti[num_ar]=tnum_x+num_addv;
for(j=tnum_x+1;j=num_x;j++)
if(j==tnum_x+num_addv-1) a[tnum_x+num_addv-1]=-1;
else if(j==tnum_x+num_addv) a[tnum_x+num_addv]=1;
else a[j]=0;
break;
case 3:
num_addv++;
num_ba++;
c[tnum_x+num_addv]=0;
base[num_ba]=tnum_x+num_addv;
for(j=tnum_x+1;j=num_x;j++)
if(j==tnum_x+num_addv) a[tnum_x+num_addv]=1;
else a[j]=0;
break;
}//switch
}//增加松弛变量、剩余变量、人工变量、确定基变量
//显示标准化后的方程组
printf("\n化为标准形式后：\n\n");
if(ma_mi==1) printf("max z= ");
else printf("max z'= ");
printf("%lg x[%d]",c[1],1);
for(i=2;i=num_x;i++) {
k=0;
for(j=1;j=num_ar;j++)
if(i==arti[j]) k=1;
if(k==1) printf(" -M x[%d]",i);
else if(c==1) printf(" + x[%d]",i);
else if(c==-1) printf(" - x[%d]",i);
else if(c=0) printf(" +%lg x[%d]",c,i);
else printf(" %lg x[%d]",c,i);
}
printf("\nst:\n");
for(i=1;i=num_st;i++) {
k=0;
for(j=1;j=num_x;j++) {
if(a[j]!=0) {
if(a[j]==1k!=0) printf(" + x[%d]",j);
else if(a[j]==1k==0) printf(" x[%d]",j);
else if(a[j]==-1) printf(" - x[%d]",j);
else if(a[j]=0k!=0) printf(" +%lg x[%d]",a[j],j);
else if(a[j]=0k==0) printf(" %lg x[%d]",a[j],j);
else printf(" %lg x[%d]",a[j],j);
k=1;
}
}
printf(" == %lg\n",b);
}
printf(" x[1]~x[%d]=0",num_x);
}
void iterative() {
int i,j,k,k_a,k_f,l; //k_a,k_f值为0或1，记录当前下标在arti[]或base[]里的搜索结果
int base_elem;
int base_out,base_in;
double sigma[MAX],temp;
double value_be; //高斯消元里保存主元素值
printf("\n\n第%d次迭代：\n\n",stop);
for(i=1;i=num_st;i++) {
printf("c%d=%lg\t",base,c[base]);
printf("b%d=%lg\t",i,b);
switch(step) {
case 1:
for(j=1;j=num_x;j++)
{
printf("a[%d][%d]=%lg\t",i,j,a[j]);
}
printf("\n");
break;
case 2:
for(j=1;j=num_x;j++) {
k_a=0;
for(l=1;l=num_ar;l++) if(j==arti[l])k_a=1;
if(k_a!=1) printf("a[%d][%d]=%lg\t",i,j,a[j]);
}
printf("\n");
break;
}
}
//求检验数sigma
for(i=1;i=num_x;i++) {
sigma=c;
for(j=1;j=num_st;j++) sigma-=c[base[j]]*a[j];
for(j=1;j=num_st;j++) if(i==base[j]) sigma=0;
switch(step) {
case 1:
printf("sigma[%d]=%lg\t",i,sigma);
break;
case 2:
k_a=0;
for(l=1;l=num_ar;l++) if(i==arti[l]) k_a=1;
if(k_a!=1) printf("sigma[%d]=%lg\t",i,sigma);
break;
}
}
putchar('\n');
//检验检验数sigma是否全小于等于0
k=0;
for(i=1;i=num_x;i++) {
if(sigma0)
k=1;
}
if(k==0) {
//sigma是全小于等于0时，检查是否为无穷多最优解
for(i=1;i=num_x;i++) {
k_f=k_a=0;
for(j=1;j=num_ar;j++)
if(i==arti[j]) k_a=1;
if(sigma==0k_a!=1) {
for(j=1;j=num_st;j++) if(i==base[j]) k_f=1;
if(k_f==0) {status=-1; return;}
}
}
status=1;
return;
}
//检查是否为无界解
for(i=1;i=num_x;i++) {
k_f=0;
if(sigma0) {
for(j=1;j=num_st;j++) if(a[j]0) k_f=1;
if(k_f!=1) {status=0; return;}
}
}
//确定换入变量
for(i=1;i=num_x;i++) {
k=0;
for(j=1;j=num_st;j++) if(i==base[j]) k=1;
if(k==0sigma0) temp=sigma-1;
}//temp赋初值
for(i=1;i=num_x;i++) {
k=0;
for(j=1;j=num_st;j++) if(i==base[j]) k=1;
if(k==0)
if(sigmatempsigma0) {
base_in=i;
temp=sigma;
}
}
//确定换出变量
for(i=1;i=num_st;i++)
if(a[base_in]0) {
temp=b/a[base_in]+1;
break;
}//temp赋初值
for(i=1;i=num_st;i++) {
if(b/a[base_in]=tempa[base_in]0) {
for(j=1;j=num_ar;j++)
if(base==arti[j]) {
base_out=base;
base_elem=i;
temp=b/a[base_in];
break;
}
}//人工变量优先换出
if(b/a[base_in]tempa[base_in]0) {
base_out=base;
base_elem=i;
temp=b/a[base_in];
}
}
printf(" 基变量：");
for(i=1;i=num_st;i++) printf("x[%d] ",base);
printf("换入变量：x[%d] 换出变量：x[%d]",base_in,base_out);
//基变量变换，进行新方程初始化后迭代
for(i=1;i=num_st;i++) {
if(base==base_out) base=base_in;
}
//初始化主元素行系数
value_be=a[base_elem][base_in];
b[base_elem]/=value_be;
for(i=1;i=num_x;i++) a[base_elem]/=value_be;
for(i=1;i=num_st;i++) {
if(i!=base_elem) {
b-=b[base_elem]*a[base_in];
value_be=a[base_in];
for(j=1;j=num_x;j++) a[j]-=a[base_elem][j]*value_be;
}
}
stop++;
if(stopSTP) {status=-2; return;}
iterative();
}
void output() {
int i,j;
double X[MAX];
printf("\n结果如下：\n");
printf("\nX=(");
for(i=1;i=num_x;i++) {
for(j=1;j=num_st;j++)
if(i==base[j]) {X=b[j];break;}
else X=0;
printf("%lg ",X);
}
printf(")");
for(i=1;i=num_x;i++) max+=c*X;
if(ma_mi==1) printf("\nMax z= %lf\n",max);
else printf("\nMin z= %lf\n",-max);
}
java新手,求完整的源代码
//都是从新手过来的，以下代码供参考
//1.
public class BankAccount {
private static String acctnum;
private static double money;
private static void showAcct() {
System.out.println("账号为: " + acctnum);
}
private static void showMoney() {
System.out.println("余额为: " + money);
}
public BankAccount(String acc, double m) {
this.acctnum = acc;
this.money = m;
}
public static void main(String[] args) {
BankAccount ba = new BankAccount("626600018888", 5000.00);
ba.showAcct();
ba.showMoney();
}
}
//2.
public class Triangle {
private static float a;
private static float b;
private static float c;
public Triangle(float a, float b, float c) {
this.a = a;
this.b = b;
this.c = c;
}
public static boolean judgeTriangle(float a, float b, float c) {
if ((a Math.abs(b - c) a b + c)
(b Math.abs(a - c) b a + c)
(c Math.abs(a - b) c a + b))
return true;
else
return false;
}
public float getCircumference() {
return this.a + this.b + this.c;
}
}
//3.
public class TestTriangle {
public static void main(String[] args) {
Triangle t = new Triangle(5.3f,7.8f,9.3f);
if(t.judgeTriangle(5.3f,7.8f,9.3f)){
System.out.print("能够成三角形，周长为: ");
System.out.printf("%9.2f",t.getCircumference());}
else
System.out.println("不能构成三角形");
}
}
求编写一个超级简单的Java的程序源代码
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
class ConstructFrame extends JFrame
{
private static final long serialVersionUID = 1L;
String value1="",result,value2="";
int flag=0,fix=0,sum=1;
Boolean happy;
JTextField text=new JTextField(30);
int flagsum=0;
Container c=getContentPane();
JButton buttonx;
ConstructFrame()
{ super("计算器");
c.setLayout(null);
c.setBackground(Color.blue);
this.setSize(400, 400);
c.add(text);
text.setHorizontalAlignment(JTextField.RIGHT);
final JButton buttonx=new JButton("BackSpace");
c.add(buttonx);
buttonx.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
int count=0;
String temp;
if(flag==0)
{
count=value1.length();
if(count!=1)
temp=value1.substring(0, count-1);
else
temp="0";
value1=temp;
}
else
{
count=value2.length();
if(count!=1)
temp=value2.substring(0, count-1);
else
temp="0";
value2=temp;
}
text.setText(temp);
}
});
final JButton buttony=new JButton("CE");
c.add(buttony);
buttony.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
value1="";
value2="";
flag=0;
text.setText("0");
}
});
final JButton button1=new JButton("1");
c.add(button1);
button1.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+1;
temp=value1;
}
else
{
value2=value2+1;
temp=value2;
}
text.setText(temp);
}
});
final JButton button2=new JButton(" 2 ");
c.add(button2);
button2.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+2;
temp=value1;
}
else
{
value2=value2+2;
temp=value2;
}
text.setText(temp);
}
});
final JButton button3=new JButton("3");
c.add(button3);
button3.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+3;
temp=value1;
}
else
{
value2=value2+3;
temp=value2;
}
text.setText(temp);
}
});
final JButton button4=new JButton("4");
c.add(button4);
button4.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+4;
temp=value1;
}
else
{
value2=value2+4;
temp=value2;
}
text.setText(temp);
}
});
final JButton button5=new JButton("5");
c.add(button5);
button5.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+5;
temp=value1;
}
else
{
value2=value2+5;
temp=value2;
}
text.setText(temp);
}
});
final JButton button6=new JButton("6");
c.add(button6);
button6.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+6;
temp=value1;
}
else
{
value2=value2+6;
temp=value2;
}
text.setText(temp);
}
});
final JButton button7=new JButton("7");
c.add(button7);
button7.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+7;
temp=value1;
}
else
{
value2=value2+7;
temp=value2;
}
text.setText(temp);
}
});
final JButton button8=new JButton("8");
c.add(button8);
button8.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+8;
temp=value1;
}
else
{
value2=value2+8;
temp=value2;
}
text.setText(temp);
}
});
final JButton button9=new JButton("9");
c.add(button9);
button9.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+9;
temp=value1;
}
else
{
value2=value2+9;
temp=value2;
}
text.setText(temp);
}
});
final JButton button0=new JButton("0");
c.add(button0);
button0.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
String temp;
if(flag==0)
{
value1=value1+0;
temp=value1;
}
else
{
value2=value2+0;
temp=value2;
}
text.setText(temp);
}
});
final JButton buttonadd=new JButton(" + ");
c.add(buttonadd);
buttonadd.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
flag=1;
fix=1;
flagsum=0;
}
});
final JButton buttonsubtract=new JButton(" - ");
c.add(buttonsubtract);
buttonsubtract.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
flag=1;
fix=2;
flagsum=0;
}
});
final JButton buttoncheng=new JButton(" * ");
c.add(buttoncheng);
buttoncheng.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
flag=1;
fix=3;
flagsum=0;
}
});
final JButton buttonchu=new JButton(" / ");
c.add(buttonchu);
buttonchu.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
flag=1;
flagsum=0;
fix=4;
}
});
final JButton buttonequal=new JButton(" = ");
c.add(buttonequal);
buttonequal.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{
double temp1,temp2;
double temp=0;
flagsum=0;
temp1=Double.parseDouble(value1);
temp2=Double.parseDouble(value2);
flag=0;
switch(fix)
{
case 1: temp=temp1+temp2;break;
case 2: temp=temp1-temp2;break;
case 3: temp=temp1*temp2;break;
case 4: temp=temp1/temp2;break;
}
result=Double.valueOf(temp).toString();
value1=result;
value2="";
flag=1;
text.setText(result);
}
});
final JButton buttonpoint=new JButton(".");
c.add(buttonpoint);
buttonpoint.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{ if(flagsum==0)
{
String temp;
if(flag==0 )
{
value1=value1+".";
temp=value1;
}
else
{
value2=value2+".";
temp=value2;
}
flagsum=1;
text.setText(temp);
}
}
});
JButton buttonz=new JButton("Start");
c.add(buttonz);
buttonz.addMouseListener(new MouseAdapter()
{
public void mousePressed(MouseEvent e)
{ if(sum%2==1)
{
happy=true;
text.setText("0.");
flag=0;
}
else
{
happy=false;
value1="";
value2="";
text.setText("");
}
text.setEnabled(happy);
button1.setEnabled(happy);
button2.setEnabled(happy);
button3.setEnabled(happy);
button4.setEnabled(happy);
button5.setEnabled(happy);
button6.setEnabled(happy);
button7.setEnabled(happy);
button8.setEnabled(happy);
button9.setEnabled(happy);
button0.setEnabled(happy);
buttonx.setEnabled(happy);
buttony.setEnabled(happy);
buttonadd.setEnabled(happy);
buttonsubtract.setEnabled(happy);
buttonpoint.setEnabled(happy);
buttonequal.setEnabled(happy);
buttoncheng.setEnabled(happy);
buttonchu.setEnabled(happy);
sum++;
}
});
button1.setEnabled(false);
button2.setEnabled(false);
button3.setEnabled(false);
button4.setEnabled(false);
button5.setEnabled(false);
button6.setEnabled(false);
button7.setEnabled(false);
button8.setEnabled(false);
button9.setEnabled(false);
button0.setEnabled(false);
buttonx.setEnabled(false);
buttony.setEnabled(false);
buttonadd.setEnabled(false);
buttonsubtract.setEnabled(false);
buttonpoint.setEnabled(false);
buttonequal.setEnabled(false);
buttoncheng.setEnabled(false);
buttonchu.setEnabled(false);
text.setEnabled(false);
text.setBounds(20, 20, 200, 40);
buttonx.setBounds(20, 60,100, 40);
buttony.setBounds(140, 60,100, 40);
buttonz.setBounds(260, 60,80, 40);
button1.setBounds(20, 120,60, 40);
button2.setBounds(100, 120,60, 40);
button3.setBounds(180, 120,60, 40);
buttonadd.setBounds(260, 120,60, 40);
button4.setBounds(20, 180,60, 40);
button5.setBounds(100, 180,60, 40);
button6.setBounds(180, 180,60, 40);
buttonsubtract.setBounds(260, 180,60, 40);
button7.setBounds(20, 240,60, 40);
button8.setBounds(100, 240,60, 40);
button9.setBounds(180, 240,60, 40);
buttoncheng.setBounds(260,240,60,40);
button0.setBounds(20, 300,60, 40);
buttonpoint.setBounds(100, 300, 60, 40);
buttonequal.setBounds(180,300,60, 40);
buttonchu.setBounds(260, 300,60, 40);
setVisible(true);
}
class MYMouseEvent extends MouseAdapter
{
public void mousePressed(MouseEvent e)
{
value1=e.toString();
text.setText(value1);
}
}
}
class Calutator
{
public static void main(String[] args)
{
new ConstructFrame();
}
}
线性规划java源代码你自己慢慢线性规划java源代码的看吧线性规划java源代码！
线性规划java源代码的介绍就聊到这里吧，感谢你花时间阅读本站内容，更多关于线性规划程序编写、线性规划java源代码的信息别忘了在本站进行查找喔。
