| 网站首页 | 业界新闻 | 小组 | 威客 | 人才 | 下载频道 | 博客 | 代码贴 | 在线编程 | 编程论坛
欢迎加入我们,一同切磋技术
用户名:   
 
密 码:  
共有 1160 人关注过本帖
标题:线性规划算法求注释 看不太懂
只看楼主 加入收藏
wpz0524
Rank: 1
等 级:新手上路
帖 子:1
专家分:0
注 册:2012-9-22
结帖率:0
收藏
已结贴  问题点数:20 回复次数:2 
线性规划算法求注释 看不太懂
/**
 *
 */
package com.dhcc.LinearProgramming;

/**
 * @author Administrator
 *单纯型算法
 */
public class LinearProgram {
   
    private int m;  //约束条件的个数
    private int n;  //变量个数
    private int m1; //<=的约束条件个数
    private int m2; //=的约束条件个数
    private int m3; //>=的约束条件个数
    private int error; //判断是否是错误的
    private int basic[];
    private int nonbasic[];
    private double a[][]; //约束条件的系数矩阵
    private double minmax; //目标函数的最大值或最小值
   
    /**
     *
     * @param minmax -求函数的最大值或最小值
     * @param m -约束条件的个数
     * @param n -变量个数
     * @param m1 -<=的约束条件个数
     * @param m2 -=的约束条件个数
     * @param m3 ->=的约束条件个数
     * @param a -约束条件的系数矩阵
     * @param x -目标函数的价值系数
     */
    public LinearProgram(double minmax,int m,int n,int m1,int m2,int m3,double a[][],int x[])
    {
        double value;
        this.error = 0;
        this.minmax = minmax;
        this.m = m;
        this.n = n;
        this.m1 = m1;
        this.m2 = m2;
        this.m3 = m3;
        if(m != m1+m2+m3)
        {
            this.error = 1;
        }
        this.a = new double[m+2][];
        for(int i = 0; i < m+2; i++)
        {
            this.a[i] = new double[n+m+m3+1];
        }
        this.basic = new int[m+2];
        this.nonbasic = new int[n+m3+1];
        for(int i = 0; i <= m+1; i++)
        {
            for(int j = 0; j <= n+m+m3; j++)
            {
                this.a[i][j] = 0.0;
            }
        }
        for(int j = 0; j <= n+m3; j++)
        {
            nonbasic[j] = j;
        }
        for(int i = 1,j = n+m3+1; i <= m; i++,j++)
        {
            basic[i]=j;
        }
        for(int i = m-m3+1,j = n+1; i<= m; i++,j++)
        {
            this.a[i][j]=-1;
            this.a[m+1][j]=-1;
        }
        for(int i = 1; i <= m; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                value = a[i-1][j-1];
                this.a[i][j]=value;
            }
            value = a[i-1][n];
            if(value<0)
            {
                error = 1;
            }
            this.a[i][0]=value;
        }
//////////////////////////////////////////////////////////
//        for(int i = 0; i <= m+1; i++)
//        {
//            for(int j = 0; j <= n+m+m3; j++)
//            {
//                System.out.print(this.a[i][j]+"**");
//            }
//            System.out.print("\n");
//        }
///////////////////////////////////////////////////////////
        for(int j = 1; j <= n; j++) //价值系数
        {
            value = x[j - 1];
            this.a[0][j] = value * minmax;
        }
        for(int j = 1; j <= n; j++)
        {
            value = 0;
            for(int i = m1+1; i <= m; i++)
                value+=this.a[i][j];
            this.a[m+1][j]=value;
        }
        
    }
   
    public int enter(int objrow)
    {
        int col = 0;
        for(int j = 1; j <= this.n + this.m3; j++)
        {
            if(this.nonbasic[j] <= this.n + this.m1 + this.m3 && this.a[objrow][j] > 10e-8)
            {
                col=j;
                break;
            }
        }
        return col;
    }
   
    public int leave(int col)
    {
        double temp=-1;
        int row  = 0;
        for(int i = 1; i <= this.m; i++)
        {
            double val = this.a[i][col];
            if( val > 10e-8)
            {
                val = this.a[i][0]/val;
                if(val < temp || temp == -1)
                {
                    row = i;
                    temp = val;
                }
            }
        }
        return row;
    }
   
    public void swapbasic(int row,int col)
    {
        int temp = this.basic[row];
        this.basic[row] = this.nonbasic[col];
        this.nonbasic[col] = temp;
    }
   
    public void pivot(int row,int col)
    {
        for(int j = 0;j <= this.n + this.m3; j++)
        {
            if(j != col)
            {
                this.a[row][j] = this.a[row][j] / this.a[row][col];
            }
        }
        this.a[row][col] = 1.0 / this.a[row][col];
        for(int i = 0; i <= this.m + 1; i++)
        {
            if(i != row)
            {
                for(int j = 0; j <= this.n + this.m3; j++)
                {
                    if(j != col)
                    {
                        this.a[i][j] = this.a[i][j] - this.a[i][col] * this.a[row][j];
                        if(Math.abs(this.a[i][j]) < 10e-8)
                            this.a[i][j]=0;
                    }
                }
                this.a[i][col] = -this.a[i][col] * this.a[row][col];
            }
        }
        swapbasic(row,col);
    }
   
    public int simplex(int objrow)
    {
        int row = 0;
        while(true)
        {
            int col = enter(objrow);
            if(col > 0)
            {
                row=leave(col);
            }
            else
            {
                return 0;
            }
            if(row > 0)
            {
                pivot(row,col);
            }
            else
            {
                return 2;
            }
        }
    }
   
    public int phase1()
    {
        this.error = simplex(this.m + 1);
        if(this.error > 0)
        {
            return this.error;
        }
        for(int i = 1; i <= this.m; i++)
        {
            if(this.basic[i] > this.n + this.m1 + this.m3)
            {
                if(this.a[i][0] > 10e-8)
                {
                    return 3;
                }
                for(int j = 1; j <= this.n; j++)
                {
                    if(Math.abs(this.a[i][j]) >= 10e-8)
                    {
                        pivot(i,j);
                        break;
                    }
                }
            }
        }
        return 0;
    }
   
    public int phase2()
    {
        return simplex(0);
    }
   
    public int compute()
    {
        if(this.error > 0)
            return this.error;
        if(this.m != this.m1)
        {
            this.error = phase1();
            if(this.error > 0)
                return this.error;
        }
        return phase2();
    }
   
    public void solve()
    {
        error=compute();
        switch(error)
        {
        case 0:
            output();
            break;
        case 1:
            System.out.println("输入数据错误!");
            break;
        case 2:
            System.out.println("无界解!");
            break;
        case 3:
            System.out.println("无可行解!");
            break;
        default:
            break;
        }
    }
   
    public void output()
    {
        int basicp[] = new int[n+1];
        for(int i = 0; i <= n; i++)
        {
            basicp[i] = 0;
        }
        for(int i = 1; i <= m; i++)
        {
            if(basic[i] >= 1 && basic[i] <= n)
            {
                basicp[basic[i]] = i;
            }
        }
        for(int i = 1; i <= n; i++)
        {
            System.out.print("x"+i+"=");
            if(basicp[i] != 0)
            {
                System.out.print(a[basicp[i]][0]);
            }
            else
            {
                System.out.print("0");
            }
            System.out.println();
        }
        System.out.println("最优值:"+-minmax*a[0][0]);
    }
   
   
//    public static void main(String[] args) {
//        // TODO Auto-generated method stub
//        double a[][] = {{1,-2,1,11},{-2,0,1,1},{-4,1,2,3}};
//        int x[] = {-3,1,1};
//        LinearProgram lp = new LinearProgram(-1,3,3,1,1,1,a,x);
//        lp.solve();
//
//    }

}

搜索更多相关主题的帖子: public package private double 
2012-09-22 10:00
ciinccb
Rank: 2
等 级:论坛游民
威 望:3
帖 子:10
专家分:36
注 册:2012-9-21
收藏
得分:10 
这谁给你看,没有重点!
2012-09-22 18:01
六代
Rank: 2
等 级:论坛游民
帖 子:10
专家分:19
注 册:2012-9-19
收藏
得分:10 
惭愧,没看懂!!
2012-09-22 20:04
快速回复:线性规划算法求注释 看不太懂
数据加载中...
 
   



关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.012846 second(s), 7 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved