# LambertOrbitSolverAddLanguageSpecificTextSet("LST17F051DA_0?cpp=::|nu=.");SolveMinimumDurationMultipleRevolutionTransfer Method (Cartesian, Cartesian, Int32, LambertPathType, OrbitDirectionType, Cartesian)

Solves the constrained Lambert problem given the input. Solver is constrained to return the minimum-duration, multiple-revolution solution.

Namespace:  AGI.Foundation.Propagators
Assembly:  AGI.Foundation.Models (in AGI.Foundation.Models.dll) Version: 24.2.419.0 (24.2.419.0)
Syntax
```public LambertResult SolveMinimumDurationMultipleRevolutionTransfer(
Cartesian initialPosition,
Cartesian finalPosition,
int numberOfRevolutions,
LambertPathType pathType,
OrbitDirectionType directionOfFlight,
Cartesian orbitalPlaneVector
)```

#### Parameters

initialPosition
Type: AGI.Foundation.CoordinatesCartesian
The starting position of the orbit/transfer.
finalPosition
Type: AGI.Foundation.CoordinatesCartesian
The ending position of the orbit/transfer.
numberOfRevolutions
Type: SystemInt32
The number of revolutions to reach the final position.
pathType
Type: AGI.Foundation.PropagatorsLambertPathType
Specifies whether the Lambert algorithm should take the smaller or large semi-major axis path when the revolution count is greater than 0.
directionOfFlight
Type: AGI.Foundation.CoordinatesOrbitDirectionType
orbitalPlaneVector
Type: AGI.Foundation.CoordinatesCartesian
A vector that is used in conjunction with the initial position of the spacecraft to define the orbital plane in the case of ambiguity. Typically, the velocity at the initial position if known.

#### Return Value

Type: LambertResult
The motion at the initial and final positions and the time of flight.
Exceptions
ExceptionCondition
ArgumentOutOfRangeExceptionThrown if the numberOfRevolutions is zero.
Remarks

The minimum-duration, multiple-revolution solution is useful for providing a minimum bound on the possible durations of orbits that have the desired number of revolutions.

Multiple revolution transfers spanning odd multiples of π in angle subtended (e.g. 3pi, 5pi, etc.) are difficult for the solver to calculate, so loosening the tolerances or increasing the iteration count may be necessary for convergence if the vectors are separated by angles that are close to odd multiples of pi.