A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems (Q5892653): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3815146 / rank | |||
Normal rank | |||
Latest revision as of 13:20, 10 June 2024
scientific article; zbMATH DE number 2186034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems |
scientific article; zbMATH DE number 2186034 |
Statements
A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems (English)
0 references
4 July 2005
0 references
multiple objective linear programming
0 references
primaldual
0 references
infeasible-interior-point algorithm
0 references
0 references
