Introduction: New approaches to linear programming (Q1088596): Difference between revisions

This issue of Algorithmica presents papers on various aspects of nonlinear methods for solving linear programming problems, inspired by the work of Karmarkar. This introduction describes some of these aspects and briefly mentions other recent developments in the field. A bibliography of recent articles is included.

0 references

zbMATH Keywords

interior-point methods

0 references

rescaling

0 references

nonlinear methods

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A monotonic projective algorithm for fractional linear programming

0 references

A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm

0 references

The iterative step in the linear programming algorithm of N. Karmarkar

0 references

A polynomial Newton method for linear programming

0 references

A multiplicative barrier function method for linear programming

0 references

A new polynomial-time algorithm for linear programming

0 references

Q4197641

0 references

Determining basic variables of optimal solutions in Karmarkar's new LP algorithm

0 references

Normal solutions of linear programs

0 references

Boundary Behavior of Interior Point Algorithms in Linear Programming

0 references

A feasible direction method for linear programming

0 references

Homotopy techniques in linear programming

0 references

A projective method for linear programming with box-type constraints

0 references

An extension of Karmarkar's algorithm for linear programming using dual variables

0 references

A modification of Karmarkar's linear programming algorithm

0 references

Identifiers

zbMATH Open document ID

0612.90082

0 references

DOI

10.1007/BF01840453

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1088596

@@ Property / cites work @@
+A monotonic projective algorithm for fractional linear programming
+Normal rank
@@ Property / cites work @@
+A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
+Normal rank
@@ Property / cites work @@
+The iterative step in the linear programming algorithm of N. Karmarkar
+Normal rank
@@ Property / cites work @@
+A polynomial Newton method for linear programming
@@ Property / cites work: A polynomial Newton method for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+A multiplicative barrier function method for linear programming
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4197641
@@ Property / cites work: Q4197641 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
+Normal rank
@@ Property / cites work @@
+Normal solutions of linear programs
@@ Property / cites work: Normal solutions of linear programs / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary Behavior of Interior Point Algorithms in Linear Programming
+Normal rank
@@ Property / cites work @@
+A feasible direction method for linear programming
+Normal rank
@@ Property / cites work @@
+Homotopy techniques in linear programming
@@ Property / cites work: Homotopy techniques in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+A projective method for linear programming with box-type constraints
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's algorithm for linear programming using dual variables
+Normal rank
@@ Property / cites work @@
+A modification of Karmarkar's linear programming algorithm
+Normal rank