# Difference between revisions of "ApCoCoA-1:GLPK.LPSolve"

From ApCoCoAWiki

Line 8: | Line 8: | ||

<example> | <example> | ||

− | Linear programming example 1996 MBA exam | + | <em>Linear programming example 1996 MBA exam</em> |

A cargo plane has three compartments for storing cargo: front, centre and rear. | A cargo plane has three compartments for storing cargo: front, centre and rear. | ||

Line 33: | Line 33: | ||

among the compartments so that the total profit for the flight is maximised. | among the compartments so that the total profit for the flight is maximised. | ||

</example> | </example> | ||

+ | |||

+ | To solve this problem we had to compose a linear program. | ||

+ | |||

</description> | </description> | ||

## Revision as of 21:43, 11 November 2008

## LPSolve

solve linear programms

### Syntax

GLPK.LPSolv(Polynome:LIST, TrennInt:LIST, Bounds:LIST, Methode:STRING, MinMax:STRING)

### Description

#### Example

<em>Linear programming example 1996 MBA exam</em> A cargo plane has three compartments for storing cargo: front, centre and rear. These compartments have the following limits on both weight and space: Compartment Weight capacity (tonnes) Space capacity (cubic metres) Front 10 6800 Centre 16 8700 Rear 8 5300 Furthermore, the weight of the cargo in the respective compartments must be the same proportion of that compartment's weight capacity to maintain the balance of the plane. The following four cargoes are available for shipment on the next flight: Cargo Weight (tonnes) Volume (cubic metres/tonne) Profit (£/tonne) C1 18 480 310 C2 15 650 380 C3 23 580 350 C4 12 390 285 Any proportion of these cargoes can be accepted. The objective is to determine how much (if any) of each cargo C1, C2, C3 and C4 should be accepted and how to distribute each among the compartments so that the total profit for the flight is maximised.

To solve this problem we had to compose a linear program.