# Difference between revisions of "2020 Cornell Optimization Open Textbook Feedback"

Jump to navigation
Jump to search

Line 2: | Line 2: | ||

* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||

− | |||

*# Remove colon in the subsection title | *# Remove colon in the subsection title | ||

− | |||

− | |||

==[[Simplex algorithm]]== | ==[[Simplex algorithm]]== | ||

* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||

− | + | * References | |

− | * References | ||

− | |||

==[[Computational complexity]]== | ==[[Computational complexity]]== | ||

* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||

− | |||

* At least one numerical example | * At least one numerical example | ||

− | *# | + | *# Finding subsets of a set is not O(2^n). |

* A section to discuss and/or illustrate the applications | * A section to discuss and/or illustrate the applications | ||

*# The applications mentioned need to be discussed further. | *# The applications mentioned need to be discussed further. |

## Revision as of 22:54, 14 December 2020

## Duality

- Theory, methodology, and/or algorithmic discussions
- Remove colon in the subsection title

## Simplex algorithm

- Theory, methodology, and/or algorithmic discussions
- References

## Computational complexity

- Theory, methodology, and/or algorithmic discussions
- At least one numerical example
- Finding subsets of a set is not O(2^n).

- A section to discuss and/or illustrate the applications
- The applications mentioned need to be discussed further.

## Network flow problem

- At least one numerical example
- There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.
- The subsection title style should be consistent.

## Interior-point method for LP

- An introduction of the topic
- Fix typos “where A ε R”
- Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.

- At least one numerical example
- The numerical example does not use any Newton’s method iterations that are presented in the above section. Please consider using a complicated example that actually uses Newton’s iterations.
- Please type the maximization problem in LaTex form.

- A section to discuss and/or illustrate the applications
- Please double check typos and extra spaces.

## Optimization with absolute values

- An introduction of the topic
- Add few sentences on how absolute values convert optimization problem into a nonlinear optimization problem.

- Theory, methodology, and/or algorithmic discussions
- Please add more details to absolute values in nonlinear optimization. (very important!)

- A section to discuss and/or illustrate the applications
- Inline equations at the beginning of this section are not formatted properly. Please fix the notation for expected return throughout the section.

## Matrix game (LP for game theory)

- Theory, methodology, and/or algorithmic discussions
- aij are not defined in this section.

- References
- Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

## Quasi-Newton methods

- Theory, methodology, and/or algorithmic discussions
- Please ensure that few spaces are kept between the equations and equation numbers.
- Step 6 of DFP algorithm should use the same variable M as in equation 1.14.

## Markov decision process

- An introduction of the topic
- Please fix typos such as “discreet”.

- Theory, methodology, and/or algorithmic discussions
- If abbreviations are defined like MDP, use the abbreviations throughout the Wiki.

- References
- Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

## Eight step procedures

- At least one numerical example
- Please be consistent in the formatting of mathematical notations and equations.

- References
- Lecture notes may not be a credible reference. Please find the original source.

## Facility location problem

- At least one numerical example
- Mention how the formulated problem is coded and solved. No need to provide GAMS code.

- References
- Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

## Set covering problem

- Theory, methodology, and/or algorithmic discussions
- Use proper math notations for “greater than equal to”.

- At least one numerical example
- Since Table 3 provides information on aij required to formulate the constraints, Table 2 serves no purpose and should be removed from the Wiki. Table 3 can be directly generated from Table 1.
- The numerical example is solved manually without using greedy method nor LP solution method. Please solve this example both by the presented greedy algorithm and the newly added LP-based method and finally compare solutions.
- Please leave some space between equation and equation number.

## Quadratic assignment problem

- Theory, methodology, and/or algorithmic discussions
- Discuss dynamic programming and cutting plane solution techniques briefly.

- A section to discuss and/or illustrate the applications
- Please format the equation for definition of yij in the hospital layout subsection.

## Newsvendor problem

- Theory, methodology, and/or algorithmic discussions
- A math programming formulation of the optimization problem with objective function and constraints is expected for the formulation. Please add any variant of the newsvendor problem along with some operational constraints.
- A mathematical presentation of the solution technique is expected. Please consider any distribution for R and present a solution technique for that specific problem.

## Mixed-integer cuts

- A section to discuss and/or illustrate the applications
- MILP and their solution techniques involving cuts are extremely versatile. Yet, only two sentences are added to describe their applications. Please discuss their applications, preferably real-world applications, in brief. Example Wikis provided on the website could be used as a reference to do so.

## Column generation algorithms

- An introduction of the topic
- References at the end of the sentence should be placed after the period.

- Theory, methodology, and/or algorithmic discussions
- Some minor typos/article agreement issues exist “is not partical in real-world”.
- Referencing subtitle "Methodology" is not a formal way.

## Heuristic algorithms

- Theory, methodology, and/or algorithmic discussions
- Please use proper symbol for "greater than or equal to".
- Greedy method to solve minimum spanning tree seems to be missing.

## Branch and cut

- Theory, methodology, and/or algorithmic discussions
- Equation in most infeasible branching section is not properly formatted, please fix the same.
- Step 2 appears abruptly in the algorithm and does not explain much. Please add more information regarding the same.
- Step 5 contains latex code terms that are not properly formatted. Please fix the same.
- Fix typos: e.g., repeated “for the current”, men Problem can viewed as partially” ..

## Mixed-integer linear fractional programming (MILFP)

- At least one numerical example
- Please check the index notation in Mass Balance Constraints.

- References
- Please consider linking the citations to references in the reference list by using this as Wiki template, rather than using website links. https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

## Convex generalized disjunctive programming (GDP)

- An introduction of the topic
- Please refrain from defining the same abbreviations multiple times.
- Please use abbreviations throughout the page if they have been defined.

- At least one numerical example
- There is a duplicate figure.

## Fuzzy programming

- An introduction of the topic
- References at the end of the sentence should be placed after the period.

- At least one numerical example
- The numeric example should be before the applications section.

- A section to discuss and/or illustrate the applications
- Applications of fuzzy programming are quite versatile. Please discuss few of the mentioned applications briefly. The provided example Wikis can be used as a reference to write this section.

- References

## Adaptive robust optimization

- Theory, methodology, and/or algorithmic discussions
- Please check typos such as "Let
*u*bee a vector". - The abbreviation KKT is not previously defined.

- Please check typos such as "Let

## Stochastic gradient descent

- At least one numerical example
- Amount of whitespace can be reduced by changing orientation of example dataset by converting it into a table containing 3 rows and 6 columns.

- A section to discuss and/or illustrate the applications
- Deep learning can become a subsection on its own.

## RMSProp

- An introduction of the topic
- References at the end of the sentence should be placed after the period.

- Theory, methodology, and/or algorithmic discussions
- Please check grammar in this section.

- A section to discuss and/or illustrate the applications
- The applications section does not contain any discussion on applications. Please mention a few applications of the widely used RMSprop and discuss them briefly.
- Please check grammar in this section.

- References
- Please refer to the example Wikis provided to use proper citation style.

## Adam

- Theory, methodology, and/or algorithmic discussions
- References at the end of the sentence should be placed after the period.