- Office: Neill 228
- email: tasaki@wsu.edu

- T W Th, 11:30-12:30

- Department of Mathematics
- 103 Neill Hall
- P.O. Box 643113
- Washington State University
- Pullman, WA 99164-3113

Math 364

Course Information can be found in the Syllabus.

Some Notes on Day 2 in-class work.

What we did on Standard Form.

We considered graphical solutions to linear programs.

We took some time considering constraints on binary variables.

On Feb 8 we considered three things: Either/Or Constraints, the Computer Assembly problem and the Lobster Boat processing problem.

On Tuesday the 13th, we considered Sudoku, Fences and Goldbach's Conjecture.

On Thursday the 15th, we considered the idea of stationary points for finding local maxima and minima of functions of one or more variables.

I collected our discussion on Newton's Method on functions of more than one variable.

We had a discussion about cubic penalty functions on April 10.

The required homework set is here.

See this example solution to understand MINIMUM writing and explanation expectations for this course.

All homework is due on the given date in class.

See this example solution to understand MINIMUM writing and explanation expectations for this course.

- [due date] Assignment
- [Jan 11] Complete the AboutMe questionaire.
- [Jan 11] Begin reading Chapter 1 of the textbook. Focus on some modeling techniques.
- [Jan 16] Show that the Octave/Matlab Software form of a linear program is an example of the general form of an optimization problem. Both forms were given in class. See THIS. Here is the solution.
- [Jan 18] Read all of Chapter 1, answer all in-text Exercises.
- [Jan 23] Here is the assignment we discussed in class.
- [Jan 23] Be ready to discuss the two problems you chose from the list.
- [Feb 01] Review the Jane Austen problem and solve both LPs using appropriate software.
- [Feb 01] Review the class discussion of January 30 and complete the assignement. The example Octave code for the first problem is here.
- [Feb 06] Here is the homework assignment related to the two problems discussed in class.
- [Feb 27] Here is the homework assignment on Newton's Method.
- [Mar 01] Gather your thoughts about what types of Linear Programming projects may interest you. Some questions which may assist you: Are you interested in programming, modeling, solving real problems? Do you have specific interests that mesh with decision making and optimization? Are you willing to try something new or collaborate with someone else that does have a specific interest? Do you already have an idea of a project? Write your thoughts in about a half page (typewritten) or one page (handwritten), or take more space if you like.
- [Mar 06] Come to class with specific questions about required homework problems.
- [Mar 22] Read Chapter 4.
- [Mar 27] Complete the Gradient assignment which we begain in class. Here is a solution.
- [Apr 03] Complete the assignment which we started in class. Here is a solution.
- [Apr 05] Read Chapter 5.
- [Apr 10] Complete the assignment which we started in class.
- [Apr 17] Start reading Chapter 7.

I am providing code that can be used in Matlab or Octave (or octave-online.net) that solves any mixed-integer program (linear programs with possibly some integer variable constraints). The relevant files you will need are here: mip.m, ShowSolution.m, myexample.m and classexample.m.

I wrote up some notes on how you can use special commands to build large matrices that have symmetries and other structure. I wrote these in a place without WiFi and no phone camera! I hope the quality is ok.

Math 464

Course Information can be found in the Syllabus.

Here is a copy of textbook chapters 1-5 which I found online.

Assignments and quizzes shown here affect your participation grade. All items are due at 1:25PM on the date given unless specified otherwise.

- [Due Date] Assignment
- [Jan 11] Set up your Overleaf account and session. Email me the link to your project.
- [Jan 18] Exercises 1.20(a), 1.2(b)
- [Jan 23] Exercises 1.15, 1.17
- [Jan 25] Finish reading sections 1-5 of Chapter 1.
- [Jan 30] Read Chapter 2, Sections 1, 2 and 3.
- [Jan 30] Exercises 1.4, 1.8, 1.13
- [Feb 06] Read Chapter 2, Section 4, 5 and 6.
- [Feb 13] Rework (if necessary) the first seven homework problems and complete these two new problems.
- [Feb 13] Read the first two sections of Chapter 3.
- [Feb 22] Some Chapter 2 Problems.
- [Feb 20] Continue reading in Chapter 3 -- all about the Simplex Method.
- [Mar 01] Exercises 3.3, 3.5, 3.12, 3.13(extra credit).
- [Mar 06] Read Chapter 4, Sections 1-4.
- [Mar 20] Exercises 4.1, 4.2, 4.3, 4.4, 4.16, 4.43.
- [Apr 03] Read Chapter 8, Sections 1-4.
- [Apr 12] Exercises 8.5 and 8.6.
- [Apr 17] Continue reading Chapter 9.

- Tuesday January 9.
- Thursday January 11.
- Example Homework Solution Detail.
- January and February quiz solutions.
- Some solutions to quizzes: Quiz08, Quiz09, Quiz10, Quiz11 and Quiz12.

- In-Class portion: Thursday March 8. This is a 75 minute exam.
- The Take-Home Exam is due Sunday March 11 1PM.
- I wrote up a skills list that may help you focus and study.

- The final exam is scheduled for the appointed time during finals week: Monday April 30, 1:00-3:00PM.
- I wrote up a skills list that may help you focus and study.

The Capstone Project Details are given in the Syllabus and here. Two relevant files are:

Coming Soon!

- H.A. Moon and T.J. Asaki, "A Finite Hyperplane Traversal Algorithm for 1-Dimensional $L^1pTV$ Minimization, for $0 < p \leq 1$," Computational Optimization and Applications, vol. 61(3), (2015).
- Nonasymptotic Densities for Shape Reconstruction
- H.A. Van Dyke, K.R. Vixie and T.J. Asaki, "Cone Monotonicity: Structure Theorem, Properties, and Comparisons to Other Notions of Monotonicity," Abstract and Applied Analysis, vol. 2013, (2013).
- B. Van Dyke and T.J. Asaki, "Using QR Decomposition to Obtain a New Instance of Mesh Adaptive Direct Search with Uniformly Distributed Polling Directions," J. Optim. Theory Appl., vol. 159, pp. 805-821, (2013).
- M.A. Abramson, T.J. Asaki, J.E. Dennis Jr., R. Magallanez Jr. and M.J. Sottile, "An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions," Struct. Multidisc. Optim., vol. 45, pp. 53-64, (2012).
- K.R. Vixie, K. Clawson, T.J. Asaki, G. Sandine, S.P. Morgan and B. Price, "Multiscale Flat Norm Signatures for Shapes and Images," Applied Mathematical Sciences, vol. 4, no. 14, pp. 667-680, (2010).
- T.J. Asaki, "Quantitative Abel Tomography Robust to Noisy, Corrupted and Missing Data," Optim. Eng., vol. 11, pp. 381-393, (2010).
- T.J. Asaki, K.R. Vixie, M. Sottile and P. Cherepanov, "Image Denoising by Regularization on Characteristic Graphs," Applied Mathematical Sciences, vol. 4, pp. 2541-2560, (2010).
- T. Le, R. Chartrand and T.J. Asaki, "A Variational Approach to Reconstructing Images Corrupted by Poisson Noise," J. Math. Imaging Vis., vol. 27, pp. 257-263, (2007).
- [more coming soon]

I like to write short human interest pieces.

I like to ask questions.

Classic video game buff? Check out the entertaining documentary that includes me! Man vs Snake