Cutting plane algorithms for maximum problems
Siriphong Lawphongpanich
Reading Time
at 250 WPM41 minutes
The average reader, reading at a speed of 250 WPM, would take 41 minutes to read Cutting plane algorithms for maximum problems.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
2
days at 30 min/day
41
total minutes
Cutting plane algorithms for maximum problems
Published
1991
Publisher
Naval Postgraduate School
Pages
41
Description
This paper unifies the development of the cutting plane algorithm for mathematical programs and variational inequalities by providing one common framework for establishing convergence. strategies for generating cuts are provided for cases in which the algorithm yields easy and difficult subproblems. When the subproblem is easy to solve, a line search is added and a deep cut is selected to accelerate the algorithm. On the other hand, when the subproblem is difficult to solve, the problem is only solved approximately during the early iterations. This corresponds to generating cuts which are nontangential to the underlying objective function. Moreover, in the case of variational inequalities, it is shown further that the subproblem can be eliminated entirely from the algorithmic steps, thereby making the resulting algorithm especially advantageous.
Frequently Asked Questions
How many pages are in Cutting plane algorithms for maximum problems?
This edition of Cutting plane algorithms for maximum problems has approximately 41 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Cutting plane algorithms for maximum problems?
For most readers, Cutting plane algorithms for maximum problems typically takes between 51m and 34m to complete. This is based on the book's length of approximately 10,250 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 41m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 2 days • Estimated word count: 10,250 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Cutting plane algorithms for maximum problems?
The estimated word count for Cutting plane algorithms for maximum problems is approximately 10,250 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Cutting plane algorithms for maximum problems?
Cutting plane algorithms for maximum problems was written by Siriphong Lawphongpanich.
When was Cutting plane algorithms for maximum problems published?
The publication date for this specific edition is 1991. The original work may have been published on a different date.