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

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
 
(23 intermediate revisions by 2 users not shown)
Line 1: Line 1:
==[[Duality]]==
 
 
* Theory, methodology, and/or algorithmic discussions
 
*# Remove colon in the subsection title
 
 
==[[Simplex algorithm]]==
 
 
* Theory, methodology, and/or algorithmic discussions
 
* References
 
 
 
==[[Computational complexity]]==
 
==[[Computational complexity]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Numerical Example
* At least one numerical example
+
*# Finding subsets of a set is NOT O(2<sup>n</sup>).
*# Finding subsets of a set is NOT O(2^n).
+
* Application
* 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.  
 
  
 
==[[Network flow problem]]==
 
==[[Network flow problem]]==
  
* At least one numerical example
+
* Numerical Example and Solution
 
*# There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.
 
*# 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]]==
 
==[[Interior-point method for LP]]==
  
* An introduction of the topic
+
* Introduction
*# Fix typos “where A ε R”
 
 
*# Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
 
*# Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# Please type optimization problem in the formal form.
 
*# Please type optimization problem in the formal form.
*# Please double check typos and extra spaces.
 
  
 
==[[Optimization with absolute values]]==
 
==[[Optimization with absolute values]]==
Line 36: Line 22:
 
* An introduction of the topic
 
* An introduction of the topic
 
*# Add few sentences on how absolute values convert optimization problem into a nonlinear optimization problem
 
*# Add few sentences on how absolute values convert optimization problem into a nonlinear optimization problem
* A section to discuss and/or illustrate the applications
+
* Applications
 
*# Inline equations at the beginning of this section are not formatted properly. Please fix the notation for expected return throughout the section.
 
*# 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)]]==
 
==[[Matrix game (LP for game theory)]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Theory and Algorithmic Discussion
 
*# aij are not defined in this section.
 
*# aij are not defined in this section.
  
 
==[[Quasi-Newton methods]]==
 
==[[Quasi-Newton methods]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Theory and Algorithm
 
*# Please ensure that few spaces are kept between the equations and equation numbers.
 
*# Please ensure that few spaces are kept between the equations and equation numbers.
 
== [[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
 
  
 
==[[Eight step procedures]]==
 
==[[Eight step procedures]]==
  
* At least one numerical example
+
* Numerical Example
 
*# Data for the example Knapsack problem (b,w) are missing.
 
*# Data for the example Knapsack problem (b,w) are missing.
 
*# How to arrive at optimal solutions is missing.
 
*# How to arrive at optimal solutions is missing.
 
==[[Facility location problem]]==
 
 
* At least one numerical example
 
*# Mention how the formulated problem is coded and solved. No need to provide GAMS code.
 
  
 
==[[Set covering problem]]==
 
==[[Set covering problem]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Numerical Example
*# Use proper math notations for “greater than equal to”.
 
* At least one numerical example
 
 
*# Please leave some space between equation and equation number.
 
*# Please leave some space between equation and equation number.
  
Line 78: Line 50:
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Discuss dynamic programming and cutting plane solution techniques briefly.
 
*# Discuss dynamic programming and cutting plane solution techniques briefly.
* A section to discuss and/or illustrate the applications
 
  
 
==[[Newsvendor problem]]==
 
==[[Newsvendor problem]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Formulation
 
*# 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 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.  
 
*# A mathematical presentation of the solution technique is expected. Please consider any distribution for R  and present a solution technique for that specific problem.  
Line 88: Line 59:
 
==[[Mixed-integer cuts]]==
 
==[[Mixed-integer cuts]]==
  
* A section to discuss and/or illustrate the applications
+
* 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.
 
*# 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”.
 
  
 
==[[Heuristic algorithms]]==
 
==[[Heuristic algorithms]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Methodology
*# Please use proper symbol for "greater than or equal to".
 
 
*# Greedy method to solve minimum spanning tree seems to be missing.
 
*# Greedy method to solve minimum spanning tree seems to be missing.
  
 
==[[Branch and cut]]==
 
==[[Branch and cut]]==
  
* Theory, methodology, and/or algorithmic discussions
+
* Methodology & Algorithm
*# Equation in most infeasible branching section is not properly formatted, please fix the same.
+
*# Equation in most infeasible branching section is not properly formatted.
 
*# Step 2 appears abruptly in the algorithm and does not explain much. Please add more information regarding 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.
+
*# Step 5 contains latex code terms that are not properly formatted.
*# Fix typos:  e.g., repeated “for the current”, men Problem can viewed as partially” ..
 
  
 
== [[Mixed-integer linear fractional programming (MILFP)]] ==
 
== [[Mixed-integer linear fractional programming (MILFP)]] ==
  
* At least one numerical example
+
* Application and Modeling for Numerical Examples
 
*# Please check the index notation in Mass Balance Constraint
 
*# Please check the index notation in Mass Balance Constraint
 
==[[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]]==
 
==[[Fuzzy programming]]==
  
* An introduction of the topic
+
* Applications
*# 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.
 
*# 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
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
 
==[[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.
 
  
 
== [[Stochastic gradient descent]] ==
 
== [[Stochastic gradient descent]] ==
* At least one numerical example
+
* 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.
 
*# 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]]==
 
==[[RMSProp]]==
  
* An introduction of the topic
+
* Theory and Methodology
*# 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.
 
*# Please check grammar in this section.
* A section to discuss and/or illustrate the applications
+
* Applications and Discussion
 
*# The applications section does not contain any discussion on applications. Please mention a few applications of the widely used RMSprop and discuss them briefly.
 
*# 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.
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
  
==[[Adam]]==
+
* Reference
 
+
*# Many references listed here are not used in any of the text in the Wiki. Please link them appropriately.
* Theory, methodology, and/or algorithmic discussions
 
*# References at the end of the sentence should be placed after the period.
 

Latest revision as of 06:12, 21 December 2020

Computational complexity

  • Numerical Example
    1. Finding subsets of a set is NOT O(2n).
  • Application
    1. The applications mentioned need to be discussed further.

Network flow problem

  • Numerical Example and Solution
    1. There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.

Interior-point method for LP

  • Introduction
    1. Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
  • A section to discuss and/or illustrate the applications
    1. Please type optimization problem in the formal form.

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
  • Applications
    1. 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 and Algorithmic Discussion
    1. aij are not defined in this section.

Quasi-Newton methods

  • Theory and Algorithm
    1. Please ensure that few spaces are kept between the equations and equation numbers.

Eight step procedures

  • Numerical Example
    1. Data for the example Knapsack problem (b,w) are missing.
    2. How to arrive at optimal solutions is missing.

Set covering problem

  • Numerical Example
    1. Please leave some space between equation and equation number.

Quadratic assignment problem

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

Newsvendor problem

  • Formulation
    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.

Mixed-integer cuts

  • 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.

Heuristic algorithms

  • Methodology
    1. Greedy method to solve minimum spanning tree seems to be missing.

Branch and cut

  • Methodology & Algorithm
    1. Equation in most infeasible branching section is not properly formatted.
    2. Step 2 appears abruptly in the algorithm and does not explain much. Please add more information regarding the same.
    3. Step 5 contains latex code terms that are not properly formatted.

Mixed-integer linear fractional programming (MILFP)

  • Application and Modeling for Numerical Examples
    1. Please check the index notation in Mass Balance Constraint

Fuzzy programming

  • 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.

Stochastic gradient descent

  • 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.

RMSProp

  • Theory and Methodology
    1. Please check grammar in this section.
  • Applications and Discussion
    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.
  • Reference
    1. Many references listed here are not used in any of the text in the Wiki. Please link them appropriately.