Pages that link to "Item:Q1181732"

The following pages link to Interior point algorithms for linear programming with inequality constraints (Q1181732):

Displaying 7 items.

• A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)
• A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
• On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670) (← links)
• Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
• Potential reduction method for harmonically convex programming (Q1893464) (← links)
• New complexity results for the Iri-Imai method (Q1915925) (← links)
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)