# 2020 Cornell Optimization Open Textbook Feedback

## Duality

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Double check indexes in the dual problem. LHS of the dual problem constraint should be aji.
2. Equations in the “constructing the dual” subsection should be aligned properly.
4. Remove colon in the subsection title
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. Lecture notes may not be a credible reference. Please find the original source.

## Simplex algorithm

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. The symbol i in the second expression in dictionary functions, ranges from 1 to m.
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References 1. Please be consistent with referencing style.

## Computational complexity

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Please introduce the Big-oh notation in this section.
• At least one numerical example
1. Examples of combinatorial optimization is suggested.
• A section to discuss and/or illustrate the applications
1. The applications mentioned need to be discussed further.
• A conclusion section
• References.

## Network flow problem

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions.
• At least one numerical example
1. There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.
2. The subsection title style should be consistent.
• A section to discuss and/or illustrate the application
• A conclusion section
• References

## Interior-point method for LP

• An introduction of the topic
1. Fix typos “where A ε R”
2. Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
1. 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.
2. Please type the maximization problem in LaTex form.
• A section to discuss and/or illustrate the applications
1. Please double check typos and extra spaces.
• A conclusion section
• References

## Optimization with absolute values

• An introduction of the topic
1. Add few sentences on how absolute values convert optimization problem into a nonlinear optimization problem.
• Theory, methodology, and/or algorithmic discussions
1. Please add more details to absolute values in nonlinear optimization. (very important!)
• At least one numerical example
• A section to discuss and/or illustrate the applications
1. Inline equations at the beginning of this section are not formatted properly. Please fix the notation for expected return throughout the section.
• A conclusion section
• References

## Matrix game (LP for game theory)

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. aij are not defined in this section.
• At least one numerical example
1. Interesting example, very well explained.
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. 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

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Please ensure that few spaces are kept between the equations and equation numbers.
2. Step 6 of DFP algorithm should use the same variable M as in equation 1.14.
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References

## Markov decision process

• An introduction of the topic
1. Please fix typos such as “discreet”.
• Theory, methodology, and/or algorithmic discussions
1. If abbreviations are defined like MDP, use the abbreviations throughout the Wiki.
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. 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

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
1. Please be consistent in the formatting of mathematical notations and equations.
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. Lecture notes may not be a credible reference. Please find the original source.

## Facility location problem

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
1. Mention how the formulated problem is coded and solved. No need to provide GAMS code.
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. 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

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Use proper math notations for “greater than equal to”.
• At least one numerical example
1. 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.
2. 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.
3. Please leave some space between equation and equation number.
• A section to discuss and/or illustrate the applications
• A conclusion section
• References

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Discuss dynamic programming and cutting plane solution techniques briefly.
• At least one numerical example
• A section to discuss and/or illustrate the applications
1. Please format the equation for definition of yij in the hospital layout subsection.
• A conclusion section
• References

## Newsvendor problem

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. 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.
2. A mathematical presentation of the solution technique is expected. Please consider any distribution for R  and present a solution technique for that specific problem.
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References

## Mixed-integer cuts

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
• A section to discuss and/or illustrate the applications
1. 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.
• A conclusion section
• References

## Column generation algorithms

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions.
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References

## Heuristic algorithms

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• Reference

## Branch and cut

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Equation in most infeasible branching section is not properly formatted, please fix the same.
3. Step 5 contains latex code terms that are not properly formatted. Please fix the same.
4. Fix typos:  e.g., repeated “for the current”, men Problem can viewed as partially” ..
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References

## Mixed-integer linear fractional programming (MILFP)

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
1. Please check the index notation in Mass Balance Constraints.
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. 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
1. Please refrain from defining the same abbreviations multiple times.
2. Please use abbreviations throughout the page if they have been defined.
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
1. There is a duplicate figure.
• A section to discuss and/or illustrate the applications
• A conclusion section
• References

## Fuzzy programming

• An introduction of the topic”
1. References at the end of the sentence should be placed after the period.
• Theory, methodology, and/or algorithmic discussions
1. Very well written.
• At least one numerical example
1. The numeric example should be before the applications section.
• A section to discuss and/or illustrate the applications
1. 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.
• A conclusion section
• References
1. Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
1. Please check typos such as "Let u bee a vector".
2. The abbreviation KKT is not previously defined.
• At least one numerical example
• A section to discuss and/or illustrate the applications
• A conclusion section
• References
1. Overall, very well written.

• An introduction of the topic
• Theory, methodology, and/or algorithmic discussions
• At least one numerical example
1. 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
1. Deep learning can become a subsection on its own.
• A conclusion section
• References

## RMSProp

• An introduction of the topic
1. References at the end of the sentence should be placed after the period.
• Theory, methodology, and/or algorithmic discussions
1. Please check grammar in this section.
• At least one numerical example
• A section to discuss and/or illustrate the applications
1. The applications section does not contain any discussion on applications. Please mention a few applications of the widely used RMSprop and discuss them briefly.
2. Please check grammar in this section.
• A conclusion section
• References
1. Please refer to the example Wikis provided to use proper citation style.
2. Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization