package com.imsl.test.example.math;

import com.imsl.math.*;

/**
 * <p>
 * Solves a linear programming problem in a nonstandard form.
 * </p>
 * This examples solves the same problem as example {@link LinearProgrammingEx2}
 * expressed in a nonstandard form. The linear programming problem $${\rm {min}}
 * \,\, f(x) = -x_1 - 3x_2$$
 * <p>
 * subject to:</p>
 * <p align="center">\(0.5 \le x_1 + x_2 \le 1.5\)<br/>
 * \(0 \le x_1 \le 1.0\)<br/>
 * \(0 \le x_2 \le 1.0\)</p>
 * <p>
 * is solved.</p>
 *
 * @see <a href="LinearProgrammingEx2.java">Code</a>
 * @see <a href="doc-files/LinearProgrammingEx2.out">Output</a>
 * 
 * @deprecated <code>LinearProgramming</code> class has been deprecated.
 */
public class LinearProgrammingEx2 {

    public static void main(String args[]) throws Exception {
        int[] constraintType = {3};
        double[] upperBound = {1.0, 1.0};
        double[][] a = {{1.0, 1.0}};
        double[] b = {0.5};
        double[] upperLimit = {1.5};
        double[] c = {-1.0, -3.0};

        LinearProgramming zf = new LinearProgramming(a, b, c);

        zf.setUpperLimit(upperLimit);
        zf.setConstraintType(constraintType);
        zf.setUpperBound(upperBound);
        zf.solve();
        new PrintMatrix("Solution").print(zf.getPrimalSolution());
        new PrintMatrix("Dual Solution").print(zf.getDualSolution());
        System.out.println("Optimal Value = " + zf.getOptimalValue());
    }
}