A Demyanov-type modification for generalized linear programming - Info and Reading Options

The Open Library:

The properties were studied of the direction formed by taking the difference of two successive dual iterates of generalized linear programming (GLP), and pointed out that this direction is also solution to an associated direction finding problem. This study shows that this direction finding problem belongs to a new class of direction finding problems and propose a modification of GLP in which its original direction finding problems is replaced by another in this new class. This new direction finding problem is similar to the one used by Demyanov for minimax problems and guarantees an ascent direction for the dual function. Finally, we state and prove the convergence for the modified GLP. Keywords: Linear programming; Decomposition; Lagrangian dual; Subgradient.

Search for “A Demyanov-type modification for generalized linear programming” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "A Demyanov-type modification for generalized linear programming" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: full
• Check if available: The Open Library & The Internet Archive

Find “A Demyanov-type modification for generalized linear programming” in Libraries Near You:

Read or borrow “A Demyanov-type modification for generalized linear programming” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “A Demyanov-type modification for generalized linear programming” at a library near you.