Sunday, October 04, 2009


Like everyone in the ubuntu community, I was waiting for this occasion..Ubuntu 9.10 Karmic Koala Beta version released.Full version is scheduled to be released on October 29th, 2009. This version have an evolutionary improvement over previous releases in terms of basic functionality and it has significant performance enhancements which include vastly reduced boot up time.

Our global community of contributors and developers has worked tirelessly to get this Beta out, and there are lots of great features in there including improved boot experience, the new Ubuntu Software Center, new messaging indicator changes You can download it here...But be careful it is in its testing stage.

Why the name Karmic Koala ?

The koala is a small bear-like creature living on trees which is about 9kg in weight. Its fur is thick and usually ash grey. The koala gets its name from an ancient word meaning “no drink” because it receives most of its water required from the Eucalyptus leaves. it eats, and only drinks when ill or times when there is not enough moisture in the leaves. The Koala is found in coastal regions of eastern and southern Australia.

The progress

This is the release cycle of Ubuntu 9.10 Karmic Koala.

May 14th, 2009 - Alpha 1 release
June 11th, 2009 - Alpha 2 release
July 23th, 2009 - Alpha 3 release
August 13th, 2009 - Alpha 4 release
September 3rd, 2009 - Alpha 5 release
September 17th, 2009 - Alpha 6 release
October 1st, 2009 - Beta release
October 22nd, 2009 - Release Candidate
October 29th, 2009 - Final release of Ubuntu 9.10

Linear Programming problem solver in ubuntu

Did your teacher give you a hard linear programming(LP) problem as home assignment? Then ubuntu is ready to help you..It's very easy to solve LP problems in ubuntu.You can use the command lp_solve for that.

Format of the command:

lp_solve [options] inputfilename

The input file can be of different formats like lp , mps etc. I will use lp here.A lp file look like this( open your favorite editor- i prefer geany and start writing)

max: 143 x + 60 y;

120 x + 210 y <= 15000; 110 x + 30 y <= 4000; x + y <= 75; x >= 0;
y >= 0;

and save as "anyname.lp" // give whatever name you wanna giv ..names doesn't matter for anything.

and use the command " lp_solve -lp anyname.lp " .
This will give you the optimal solution of the objective function.This software is using the
simplex algorithm to solve the problem .

For any help use this command " lp_solve -h "

//Remaining is for newbies who dont know what a LP problem is

A linear programming problem may be defined as the problem of maximizing or minimizing a linear function subject to linear constraints. The constraints may be equalities
or inequalities. Here is a simple example.

Find numbers x1 and x2 that maximize the sum x1 + x2 subject to the constraints
x1 ≥ 0, x2 ≥ 0, and
x1 + 2x2 ≤ 4
4x1 + 2x2 ≤ 12
−x1 + x2 ≤ 1

In this problem there are two unknowns, and five constraints. All the constraints are
inequalities and they are all linear in the sense that each involves an inequality in some
linear function of the variables. The first two constraints, x1 ≥ 0 and x2 ≥ 0, are special.
These are called non-negativity constraints and are often found in linear programming
problems. The other constraints are then called the main constraints. The function to be
maximized (or minimized) is called the objective function. Here, the objective function is
x1 + x2