2020 Cornell Optimization Open Textbook Feedback: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
 
(12 intermediate revisions by the same user not shown)
Line 8: Line 8:
==[[Network flow problem]]==
==[[Network flow problem]]==


* Real Life Applications
* 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. Subsection titles in Real Life Applications section are not in title case like the ones in Theory section.


==[[Interior-point method for LP]]==
==[[Interior-point method for LP]]==


* Introduction
* Introduction
*# Fix typos “where A ε R” in Lagrange Function subsection.
*# 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
Line 36: Line 34:
* Theory and Algorithm
* 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]] ==
* Introduction
*# Please fix typos such as “discreet”.
* Theory and Methodology
*# If abbreviations are defined like MDP, use the abbreviations throughout the Wiki


==[[Eight step procedures]]==
==[[Eight step procedures]]==
Line 49: Line 40:
*# 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]]==
* Numerical Example
*# Mention how the formulated problem is coded and solved. No need to provide GAMS code.


==[[Set covering problem]]==
==[[Set covering problem]]==


* Integer linear program formulation & Approximation via LP relaxation and rounding
*# Use proper math notations for “greater than equal to”.
* Numerical Example
* Numerical Example
*# Please leave some space between equation and equation number.
*# Please leave some space between equation and equation number.
Line 77: Line 61:
* 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]]==
* Introduction
*# References at the end of the sentence should be placed after the period.
* Theory, methodology and algorithmic discussions
*# Some minor typos/article agreement issues exist “is not partical in real-world”.


==[[Heuristic algorithms]]==
==[[Heuristic algorithms]]==


* Methodology
* 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.


Line 96: Line 72:
*# Equation in most infeasible branching section is not properly formatted.
*# 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”.


== [[Mixed-integer linear fractional programming (MILFP)]] ==
== [[Mixed-integer linear fractional programming (MILFP)]] ==
Line 108: Line 83:
* Applications
* 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.
==[[Adaptive robust optimization]]==
* Problem Formulation
*# Please check typos such as "Let ''u'' bee a vector".
*# The abbreviation KKT is not previously defined.


== [[Stochastic gradient descent]] ==
== [[Stochastic gradient descent]] ==
Line 121: Line 90:
==[[RMSProp]]==
==[[RMSProp]]==


* Introduction
*# References at the end of the sentence should be placed after the period.
* Theory and Methodology
* Theory and Methodology
*# Please check grammar in this section.
*# Please check grammar in this section.
Line 128: Line 95:
*# 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.


==[[Adam]]==
* Reference
 
*# Many references listed here are not used in any of the text in the Wiki. Please link them appropriately.
* Background
*# References at the end of the sentence should be placed after the period.

Latest revision as of 07: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.