Žemiau  pateikiami  duomenys,  tiesinio  programavimo uždavinio formulavimas pagal  pateiktus
duomenis Lp_solve C  versijai  ir  Lp_solve Java  versijai bei  neasutampantys  rezultatai.
___________________________________________________________________
Duomenys:

w[ 1 ]   62.5
w[ 2 ]   62.875
w[ 3 ]   62.75
w[ 4 ]   61.75
w[ 5 ]   61.75
w[ 6 ]   61.0

T=6, p=4.
____________________________________________________________________
Tiesinio programavimo  uzdavinio Lp_solve C  versijai  formulavimas:

min:1.0 U1 + 1.0 U2 + 1.0 U3 + 1.0 U4 + 1.0 U5 + 1.0 U6;
1.0 U1 >= 62.5;
-1.0 U1 <= 62.5;
1.0 U2 + 62.5 a7 -62.5 a8 >= 62.875;
-1.0 U2 + 62.5 a7 -62.5 a8 <= 62.875;
1.0 U3 + 62.875 a7 -62.875 a8 + 62.5 a9 -62.5 a10 >= 62.75;
-1.0 U3 + 62.875 a7 -62.875 a8 + 62.5 a9 -62.5 a10 <= 62.75;
1.0 U4 + 62.75 a7 -62.75 a8 + 62.875 a9 -62.875 a10 + 62.5 a11 -62.5 a12 >= 61.75;
-1.0 U4 + 62.75 a7 -62.75 a8 + 62.875 a9 -62.875 a10 + 62.5 a11 -62.5 a12 <= 61.75;
1.0 U5 + 61.75 a7 -61.75 a8 + 62.75 a9 -62.75 a10 + 62.875 a11 -62.875 a12 + 62.5 a13 -62.5 a14 >= 61.75;
-1.0 U5 + 61.75 a7 -61.75 a8 + 62.75 a9 -62.75 a10 + 62.875 a11 -62.875 a12 + 62.5 a13 -62.5 a14 <= 61.75;
1.0 U6 + 61.75 a7 -61.75 a8 + 61.75 a9 -61.75 a10 + 62.75 a11 -62.75 a12 + 62.875 a13 -62.875 a14 >= 61.0;
-1.0 U6 + 61.75 a7 -61.75 a8 + 61.75 a9 -61.75 a10 + 62.75 a11 -62.75 a12 + 62.875 a13 -62.875 a14 <= 61.0;

_______________________________________________________________________
Tiesinio programavimo  uzdavinio Lp_solve Java  versijai  formulavimas:

//- try out the linear programming
import lp.*;

public class TestLp0 implements constant{
  public static void main(String args[]) {
    solve lpSolve = new solve();
    lprec lpIn = new lprec(0, 14);
    lpIn.debug = TRUE;
    lpIn.verbose = TRUE;
    lpIn.trace = TRUE;
        lpSolve.str_set_obj_fn(lpIn,"1.0  1.0  1.0  1.0  1.0  1.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0"); 
	lpSolve.str_add_constraint(lpIn, "1.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0 ", GE,  62.5);
	lpSolve.str_add_constraint(lpIn, "-1.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0  0.0 ", LE,  62.5);
	lpSolve.str_add_constraint(lpIn, "0.0  1.0  0.0  0.0  0.0  0.0  62.5  -62.5  0.0  0.0  0.0  0.0  0.0  0.0", GE,  62.875);
	lpSolve.str_add_constraint(lpIn, "0.0  -1.0  0.0  0.0  0.0  0.0  62.5  -62.5  0.0  0.0  0.0  0.0  0.0  0.0", LE,  62.875);
	lpSolve.str_add_constraint(lpIn, "0.0  0.0 1.0  0.0  0.0  0.0  62.875  -62.875  62.5  -62.5  0.0  0.0  0.0  0.0  ", GE, 62.75);
	lpSolve.str_add_constraint(lpIn, "0.0  0.0 -1.0  0.0  0.0  0.0  62.875  -62.875  62.5  -62.5  0.0  0.0  0.0  0.0  ", LE, 62.75);
	lpSolve.str_add_constraint(lpIn, "0.0  0.0  0.0  1.0  0.0  0.0  62.75  -62.75  62.875  -62.875  62.5  -62.5  0.0  0.0 ", GE, 61.75 );
	lpSolve.str_add_constraint(lpIn, "0.0  0.0  0.0  -1.0  0.0  0.0  62.75  -62.75  62.875  -62.875  62.5  -62.5  0.0  0.0 ", LE, 61.75 );
	lpSolve.str_add_constraint(lpIn, "0.0  0.0  0.0  0.0  1.0  0.0  61.75  -61.75  62.75  -62.75  62.875  -62.875  62.5  -62.5 ", GE, 61.75);
	lpSolve.str_add_constraint(lpIn, "0.0  0.0  0.0  0.0  -1.0  0.0  61.75  -61.75  62.75  -62.75  62.875  -62.875  62.5  -62.5 ", LE, 61.75);
	lpSolve.str_add_constraint(lpIn, "0.0  0.0  0.0  0.0  0.0  1.0  61.75  -61.75  61.75  -61.75  62.75   -62.75  62.875  -62.875  ", GE, 61.0 );
	lpSolve.str_add_constraint(lpIn, "0.0  0.0  0.0  0.0  0.0  -1.0  61.75  -61.75  61.75  -61.75  62.75   -62.75  62.875  -62.875  ", LE, 61.0 );    int result = lpSolve.solve(lpIn);
 result = lpSolve.solve(lpIn);  
 lpSolve.print_lp(lpIn);
    if (result == constant.OPTIMAL)
      lpSolve.print_solution(lpIn);
    else
      System.out.println("no optimal solution");
  } // end of main
} // end of class TestLp0

_______________________________________________
Lp_solve C  versija randa  optimalų  sprendimą:

Value of objective function:      63.26127218
U1                    62.5
U2                       0
U3                       0
U4                       0
U5                 0.76127
U6                       0
a7                   1.006
a8                       0
a9                       0
a10                0.00804
a11                      0
a12                0.01394
a13                0.00398
a14                      0

_____________________________________________________
Lp_solve Java  versija  pateikia  tokius  rezultatus:

this problem has no solution, it is unbounded
Value of objective function: 1.0E24
Var [1]  0.0
Var [2]  0.0
Var [3]  0.0
Var [4]  0.0
Var [5]  0.0
Var [6]  0.0
Var [7]  0.0
Var [8]  0.0
Var [9]  0.0
Var [10]  0.0
Var [11]  0.0
Var [12]  0.0
Var [13]  0.0
Var [14]  0.0

Var [1]  0.0