Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Remove tests for unsupported function \ #48

Merged
merged 1 commit into from
Dec 3, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 6 additions & 8 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,20 +1,20 @@
# MINLPTests.jl

This is a collection of JuMP models for testing nonlinear/polynomial solvers
This is a collection of JuMP models for testing nonlinear/polynomial solvers
with and without discrete variables in JuMP.

This version is compatible with the current release of JuMP (using
This version is compatible with the current release of JuMP (using
MathOptInterface).

[![Build Status](https://github.com/jump-dev/MINLPTests.jl/workflows/CI/badge.svg?branch=master)](https://github.com/jump-dev/MINLPTests.jl/actions?query=workflow%3ACI)
## Test Design Guidelines

* The tests are organized into broad categories based on the scope of typical
* The tests are organized into broad categories based on the scope of typical
(e.g. continuous, convex functions, polynomial, ...)
* Unit tests for JuMP integration testing should be "easy" models. For example,
it should be possible for a non-global solver to find the global solution in
* Unit tests for JuMP integration testing should be "easy" models. For example,
it should be possible for a non-global solver to find the global solution in
these tests
* Mathematical property tests can be more difficult but should strive to be as
* Mathematical property tests can be more difficult but should strive to be as
simple as possible

## Test Naming Conventions
Expand Down Expand Up @@ -71,7 +71,6 @@ z indicates a variant of a base problem
* non-linear functions
* \* (nlp/004_010)
* / (nlp/005_010)
* \ (nlp/005_011)
* ^ (nlp/001_010)
* sqrt (nlp/003_010)
* abs (nlp/004_010)
Expand Down Expand Up @@ -115,7 +114,6 @@ z indicates a variant of a base problem
* non-linear functions
* \* (nlp-mi/004_010)
* / (nlp-mi/005_010)
* \ (nlp-mi/005_011)
* ^ (nlp-mi/001_010)
* sqrt (nlp-mi/003_010)
* abs (nlp-mi/004_010)
Expand Down
36 changes: 0 additions & 36 deletions src/nlp-expr/005_011.jl

This file was deleted.

32 changes: 0 additions & 32 deletions src/nlp-mi-expr/005_011.jl

This file was deleted.

32 changes: 0 additions & 32 deletions src/nlp-mi/005_011.jl

This file was deleted.

36 changes: 0 additions & 36 deletions src/nlp/005_011.jl

This file was deleted.

16 changes: 4 additions & 12 deletions test/runtests.jl
Original file line number Diff line number Diff line change
Expand Up @@ -24,23 +24,15 @@ const MIPOLY_SOLVERS = [JUNIPER]

@testset "JuMP Model Tests" begin
@testset "$(solver): nlp" for solver in NLP_SOLVERS
MINLPTests.test_nlp(
solver,
exclude = ["005_011"], # Uses the function `\`
debug = true,
)
MINLPTests.test_nlp(solver; debug = true, exclude = ["001_010"])
MINLPTests.test_directory("nlp", solver, include = ["001_010"])
MINLPTests.test_nlp_cvx(solver)
MINLPTests.test_nlp_expr(solver; exclude = ["005_011"])
MINLPTests.test_nlp_expr(solver)
MINLPTests.test_nlp_cvx_expr(solver)
end
@testset "$(solver): nlp_mi" for solver in MINLP_SOLVERS
MINLPTests.test_nlp_mi(solver, exclude = [
"005_011", # Uses the function `\`
])
MINLPTests.test_nlp_mi_expr(solver, exclude = [
"005_011", # Uses the function `\`
])
MINLPTests.test_nlp_mi(solver)
MINLPTests.test_nlp_mi_expr(solver)
MINLPTests.test_nlp_mi_cvx(solver)
end
@testset "$(solver): poly" for solver in POLY_SOLVERS
Expand Down