# 16 List of examples¶

List of examples shipped in the distribution of Fusion API for Java:

Table 16 List of distributed examples
File Description
TrafficNetworkModel.java Demonstrates a traffic network problem as a conic quadratic problem (CQO)
alan.java A portfolio choice model alan.gms from the GAMS model library
baker.java A small bakery revenue maximization linear problem
breaksolver.java Shows how to break a long-running task
callback.java An example of data/progress callback
cqo1.java A simple conic quadratic problem
diet.java Solving Stigler’s Nutrition model diet from the GAMS model library
duality.java Shows how to access the dual solution
facility_location.java Demonstrates a small one-facility location problem (CQO)
lo1.java A simple linear problem
lownerjohn_ellipsoid.java Computes the Lowner-John inner and outer ellipsoidal approximations of a polytope (SDO, CQO)
lpt.java Demonstrates how to solve the multi-processor scheduling problem and input an integer feasible point (MIP)
milo1.java A simple mixed-integer linear problem
mioinitsol.java A simple mixed-integer linear problem with an initial guess
nearestcorr.java Solves the nearest correlation matrix problem (SDO, CQO)
parameters.java Shows how to set optimizer parameters and read information items
portfolio.java Presents several portfolio optimization models
primal_svm.java Implements a simple soft-margin Support Vector Machine (CQO)
production.java Demonstrate how to modify and re-optimize a linear problem
qcqp_sdo_relaxation.java Demonstrate how to use SDP to solve convex relaxation of a mixed-integer QCQO problem
sdo1.java A simple semidefinite optimization problem
sospoly.java Models the cone of nonnegative polynomials and nonnegative trigonometric polynomials using Nesterov’s framework
sudoku.java A SUDOKU solver (MIP)
total_variation.java Demonstrates how to solve a total variation problem (CQO)
tsp.java Solves a simple Travelling Salesman Problem and shows how to add constraints to a model and re-optimize (MIP)

Additional examples can be found on the MOSEK website and in other MOSEK publications.